IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v23y2020i5d10.1007_s10951-020-00667-2.html
   My bibliography  Save this article

Scheduling a proportionate flow shop of batching machines

Author

Listed:
  • Christoph Hertrich

    (Technische Universität Kaiserslautern
    Technische Universität Berlin)

  • Christian Weiß

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • Heiner Ackermann

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • Sandy Heydrich

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • Sven O. Krumke

    (Technische Universität Kaiserslautern)

Abstract

In this paper we study a proportionate flow shop of batching machines with release dates and a fixed number $$m \ge 2$$ m ≥ 2 of machines. The scheduling problem has so far barely received any attention in the literature, but recently its importance has increased significantly, due to applications in the industrial scaling of modern bio-medicine production processes. We show that for any fixed number of machines, the makespan and the sum of completion times can be minimized in polynomial time. Furthermore, we show that the obtained algorithm can also be used to minimize the weighted total completion time, maximum lateness, total tardiness and (weighted) number of late jobs in polynomial time if all release dates are 0. Previously, polynomial time algorithms have only been known for two machines.

Suggested Citation

  • Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    • Handle: RePEc:spr:jsched:v:23:y:2020:i:5:d:10.1007_s10951-020-00667-2
    DOI: 10.1007/s10951-020-00667-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-020-00667-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-020-00667-2?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. Dorit S. Hochbaum & Ron Shamir, 1991. "Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem," Operations Research, INFORMS, vol. 39(4), pages 648-653, August.
    2. Chung-Yee Lee & Reha Uzsoy & Louis A. Martin-Vega, 1992. "Efficient Algorithms for Scheduling Semiconductor Burn-In Operations," Operations Research, INFORMS, vol. 40(4), pages 764-775, August.
    3. Javad H. Ahmadi & Reza H. Ahmadi & Sriram Dasu & Christopher S. Tang, 1992. "Batching and Scheduling Jobs on Batch and Discrete Processors," Operations Research, INFORMS, vol. 40(4), pages 750-763, August.
    4. Philippe Baptiste, 2000. "Batching identical jobs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 355-367, December.
    5. Sung, Chang Sup & Kim, Young Hwan & Yoon, Sang Hum, 2000. "A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines," European Journal of Operational Research, Elsevier, vol. 121(1), pages 179-192, February.
    6. Shengchao Zhou & Xueping Li & Huaping Chen & Cong Guo, 2016. "Minimizing makespan in a no-wait flowshop with two batch processing machines using estimation of distribution algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4919-4937, August.
    7. Heiner Ackermann & Sandy Heydrich & Christian Weiß, 2020. "Analyzing and Optimizing the Throughput of a Pharmaceutical Production Process," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 591-597, Springer.
    8. Ward Passchyn & Frits C. R. Spieksma, 2019. "Scheduling parallel batching machines in a sequence," Journal of Scheduling, Springer, vol. 22(3), pages 335-357, June.
    9. Yi Tan & Lars Mönch & John W. Fowler, 2018. "A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines," Journal of Scheduling, Springer, vol. 21(2), pages 209-226, April.
    10. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    11. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    12. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    13. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    14. Sup Sung, Chang & Hwan Kim, Young, 2003. "Minimizing due date related performance measures on two batch processing machines," European Journal of Operational Research, Elsevier, vol. 147(3), pages 644-656, June.
    Full references (including those not matched with items on IDEAS)

    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. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2022. "Online algorithms to schedule a proportionate flexible flow shop of batching machines," Journal of Scheduling, Springer, vol. 25(6), pages 643-657, December.
    3. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    4. C S Sung & H C Rim, 2004. "Receiver set partitioning and sequencing for multicasting traffic in a WDM lightwave single-hop network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 630-639, June.
    5. Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
    6. Jolai, Fariborz, 2005. "Minimizing number of tardy jobs on a batch processing machine with incompatible job families," European Journal of Operational Research, Elsevier, vol. 162(1), pages 184-190, April.
    7. Jolai Ghazvini, Fariborz & Dupont, Lionel, 1998. "Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes," International Journal of Production Economics, Elsevier, vol. 55(3), pages 273-280, August.
    8. Damodaran, Purushothaman & Kumar Manjeshwar, Praveen & Srihari, Krishnaswami, 2006. "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 103(2), pages 882-891, October.
    9. Sung, C. S. & Choung, Y. I., 2000. "Minimizing makespan on a single burn-in oven in semiconductor manufacturing," European Journal of Operational Research, Elsevier, vol. 120(3), pages 559-574, February.
    10. Chakhlevitch, Konstantin & Glass, Celia A. & Kellerer, Hans, 2011. "Batch machine production with perishability time windows and limited batch size," European Journal of Operational Research, Elsevier, vol. 210(1), pages 39-47, April.
    11. Koh, Shie-Gheun & Koo, Pyung-Hoi & Kim, Dong-Chun & Hur, Won-Suk, 2005. "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families," International Journal of Production Economics, Elsevier, vol. 98(1), pages 81-96, October.
    12. Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu, 2020. "Mixed batch scheduling on identical machines," Journal of Scheduling, Springer, vol. 23(4), pages 487-496, August.
    13. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    14. Sung, Chang Sup & Kim, Young Hwan & Yoon, Sang Hum, 2000. "A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines," European Journal of Operational Research, Elsevier, vol. 121(1), pages 179-192, February.
    15. Sup Sung, Chang & Hwan Kim, Young, 2003. "Minimizing due date related performance measures on two batch processing machines," European Journal of Operational Research, Elsevier, vol. 147(3), pages 644-656, June.
    16. Xiaotie Deng & Chung Keung Poon & Yuzhong Zhang, 2003. "Approximation Algorithms in Batch Processing," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 247-257, September.
    17. Chung-Lun Li & Chung-Yee Lee, 1997. "Scheduling with agreeable release times and due dates on a batch processing machine," European Journal of Operational Research, Elsevier, vol. 96(3), pages 564-569, February.
    18. John Tajan & Appa Sivakumar & Stanley Gershwin, 2011. "Controlling job arrivals with processing time windows into Batch Processor Buffer," Annals of Operations Research, Springer, vol. 191(1), pages 193-218, November.
    19. Ridouard, Frédéric & Richard, Pascal & Martineau, Patrick, 2008. "On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1327-1342, September.
    20. Shabtay, Dvir & Gilenson, Miri, 2023. "A state-of-the-art survey on multi-scenario scheduling," European Journal of Operational Research, Elsevier, vol. 310(1), pages 3-23.

    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:spr:jsched:v:23:y:2020:i:5:d:10.1007_s10951-020-00667-2. 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.springer.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.