Single machine batch scheduling with resource dependent setup and processing times

Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished. Processing of a batch requires a machine setup time common for all batches. Both the job processing times and the setup...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 135; H. 1; S. 177 - 183
Hauptverfasser: Cheng, T.C.Edwin, Janiak, Adam, Kovalyov, Mikhail Y.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 16.11.2001
Elsevier
Schriftenreihe:European Journal of Operational Research
Schlagworte:
Batching
Linear programming
Polynomial algorithm
Resource allocation
Scheduling
Batching
Linear programming
Scheduling
Polynomial algorithm
Resource allocation
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished. Processing of a batch requires a machine setup time common for all batches. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource, which may be different from that for the jobs. Polynomial time algorithms are presented to find an optimal batch sequence and resource values such that either the total weighted resource consumption is minimized, subject to meeting job deadlines, or the maximum job lateness is minimized, subject to an upper bound on the total weighted resource consumption. The algorithms are based on linear programming formulations of the corresponding problems.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(00)00312-X