IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v54y2003i4d10.1057_palgrave.jors.2601512.html
   My bibliography  Save this article

Scheduling unit processing time jobs on an m-machine flow-shop

Author

Listed:
  • G Mosheiov

    (The Hebrew University)

Abstract

The sequential production of identical jobs and the flow-shop machine setting are extremely common in real-life applications. We study a scheduling problem that combines these two elements: jobs of identical processing time, with job-dependent weights, and a given common due date processed on an m-machine flow-shop. The (just-in-time) objective is to minimize the maximum earliness/tardiness cost. We introduce a polynomial time solution in both cases of (i) a non-restrictive (ie, sufficiently large) due date, and (ii) a restrictive due date (which restricts the number of early jobs).

Suggested Citation

  • G Mosheiov, 2003. "Scheduling unit processing time jobs on an m-machine flow-shop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 437-441, April.
    • Handle: RePEc:pal:jorsoc:v:54:y:2003:i:4:d:10.1057_palgrave.jors.2601512
    DOI: 10.1057/palgrave.jors.2601512
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601512
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601512?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sung, C. S. & Min, J. I., 2001. "Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date," European Journal of Operational Research, Elsevier, vol. 131(1), pages 95-106, May.
    2. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    3. Wen-Lian Hsu, 1984. "Approximation Algorithms for the Assembly Line Crew Scheduling Problem," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 376-383, August.
    4. Awi Federgruen & Gur Mosheiov, 1997. "Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 287-299, April.
    5. A. Federgruen & G. Mosheiov, 1997. "Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs," Operations Research, INFORMS, vol. 45(1), pages 66-71, February.
    6. Michael R. Garey & Robert E. Tarjan & Gordon T. Wilfong, 1988. "One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 330-348, May.
    7. Jeffrey B. Sidney, 1977. "Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties," Operations Research, INFORMS, vol. 25(1), pages 62-69, February.
    8. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shabtay, Dvir, 2012. "The just-in-time scheduling problem in a flow-shop scheduling system," European Journal of Operational Research, Elsevier, vol. 216(3), pages 521-532.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    2. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    3. G A Álvarez-Pérez & J L González-Velarde & J W Fowler, 2009. "Crossdocking— Just in Time scheduling: an alternative solution approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 554-564, April.
    4. Sridharan, V. & Zhou, Z., 1996. "A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 292-301, October.
    5. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    6. Ventura, Jose A. & Radhakrishnan, Sanjay, 2003. "Single machine scheduling with symmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 144(3), pages 598-612, February.
    7. Koulamas, Christos, 1996. "Single-machine scheduling with time windows and earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 91(1), pages 190-202, May.
    8. N. V. R. Mahadev & Aleksandar Pekeč & Fred S. Roberts, 1998. "On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?," Operations Research, INFORMS, vol. 46(3-supplem), pages 120-134, June.
    9. Sourd, Francis, 2005. "Punctuality and idleness in just-in-time scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 739-751, December.
    10. Hendel, Yann & Sourd, Francis, 2006. "Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem," European Journal of Operational Research, Elsevier, vol. 173(1), pages 108-119, August.
    11. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    12. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    13. Wang, Julong & Liu, Zhixue & Li, Feng, 2024. "Integrated production and transportation scheduling problem under nonlinear cost structures," European Journal of Operational Research, Elsevier, vol. 313(3), pages 883-904.
    14. Ventura, Jose A. & Kim, Daecheol & Garriga, Frederic, 2002. "Single machine earliness-tardiness scheduling with resource-dependent release dates," European Journal of Operational Research, Elsevier, vol. 142(1), pages 52-69, October.
    15. Weng, Michael X. & Ventura, Jose A., 1996. "Single-machine earliness-tardiness scheduling about a common due date with tolerances," International Journal of Production Economics, Elsevier, vol. 42(3), pages 217-227, April.
    16. Helmut A. Sedding, 2020. "Scheduling jobs with a V-shaped time-dependent processing time," Journal of Scheduling, Springer, vol. 23(6), pages 751-768, December.
    17. Esteve, B. & Aubijoux, C. & Chartier, A. & T'kindt, V., 2006. "A recovering beam search algorithm for the single machine Just-in-Time scheduling problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 798-813, August.
    18. Tan, Zhen & Fu, Guanqi, 2024. "Just-in-time scheduling problem with affine idleness cost," European Journal of Operational Research, Elsevier, vol. 313(3), pages 954-976.
    19. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    20. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:54:y:2003:i:4:d:10.1057_palgrave.jors.2601512. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.