Scheduling a proportionate flow shop of batching machines

dc.contributor.authorHertrich, Christoph
dc.contributor.authorWeiß, Christian
dc.contributor.authorAckermann, Heiner
dc.contributor.authorHeydrich, Sandy
dc.contributor.authorKrumke, Sven O.
dc.date.accessioned2023-07-18T13:41:45Z
dc.date.available2023-07-18T13:41:45Z
dc.date.issued2020-09-17
dc.date.updated2023-06-15T14:03:40Z
dc.description.abstractIn this paper we study a proportionate flow shop of batching machines with release dates and a fixed number 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.en
dc.description.sponsorshipDFG, 385256563, GRK 2434: Facets of Complexity
dc.identifier.eissn1099-1425
dc.identifier.issn1094-6136
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/19288
dc.identifier.urihttps://doi.org/10.14279/depositonce-18084
dc.language.isoen
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subject.ddc500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik
dc.subject.otherplanning of pharmaceutical productionen
dc.subject.otherproportionate flow shopen
dc.subject.otherbatching machinesen
dc.subject.otherpermutation schedulesen
dc.subject.otherdynamic programmingen
dc.titleScheduling a proportionate flow shop of batching machinesen
dc.typeArticle
dc.type.versionpublishedVersion
dcterms.bibliographicCitation.doi10.1007/s10951-020-00667-2
dcterms.bibliographicCitation.issue5
dcterms.bibliographicCitation.journaltitleJournal of Scheduling
dcterms.bibliographicCitation.originalpublishernameSpringer
dcterms.bibliographicCitation.originalpublisherplaceHeidelberg
dcterms.bibliographicCitation.pageend593
dcterms.bibliographicCitation.pagestart575
dcterms.bibliographicCitation.volume23
dcterms.rightsHolder.referenceCreative-Commons-Lizenz
tub.accessrights.dnbfree
tub.affiliationFak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik::FG Kombinatorische Optimierung und Graphenalgorithmen
tub.publisher.universityorinstitutionTechnische Universität Berlin

Files

Original bundle
Now showing 1 - 1 of 1
Loading…
Thumbnail Image
Name:
s10951-020-00667-2.pdf
Size:
550.73 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.86 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections