Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

This paper considers the parallel batch processing machine scheduling problem which involves the constraints of unequal ready times, non-identical job sizes, and batch dependent processing times in order to sequence batches on identical parallel batch processing machines with capacity restrictions....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production research 2009-09, Vol.47 (18), p.5109-5128
Hauptverfasser:	Chung, S.H., Tai, Y.T., Pearn, W.L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Batch processing Exact sciences and technology Heuristic Integer programming Inventory control, production control. Distribution Job shops LCDs Linear programming Liquid crystal displays Mathematical programming Operational research and scientific management Operational research. Management science Optimization algorithms parallel batch scheduling unequal ready time Scheduling Scheduling, sequencing Sequential scheduling Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!