Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Naval research logistics Jg. 64; H. 8; S. 628 - 641
Hauptverfasser:	Li, Shisheng, Cheng, T.C.E., Ng, C.T., Yuan, Jinjiang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Wiley Subscription Services, Inc 01.12.2017
Schlagworte:	Approximation Batch processing Compatibility Completion time Criteria dynamic programming FPTAS Lateness Mathematical models Optimization Polynomials Production scheduling Scheduling sequential and compatible batch single‐machine scheduling two agents Upper bounds
ISSN:	0894-069X, 1520-6750
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!