Scheduling a proportionate flow shop of batching machines

Christoph Hertrich (), Christian Weiß (), Heiner Ackermann (), Sandy Heydrich () and Sven O. Krumke ()
Additional contact information
Christoph Hertrich: Technische Universität Kaiserslautern
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

Journal of Scheduling, 2020, vol. 23, issue 5, No 4, 575-593

Abstract: 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.

Keywords: Planning of pharmaceutical production; Proportionate flow shop; Batching machines; Permutation schedules; Dynamic programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-020-00667-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:23:y:2020:i:5:d:10.1007_s10951-020-00667-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-020-00667-2

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().