Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times [An article from: Computers and Operations Research]

Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times [An article from: Computers and Operations Research]

T.C.E. Cheng , J.J. Yuan , A.F. Yang
Inga betyg ännu
Apr 1, 2005 · Engelska · e-bok (10 sidor)
Lägg till på hyllan

Betygsätt denna bok


Exportera bokjournal

Bokdetaljer

Format e-bok
Sidor 10
Språk Engelska
Publicerad Apr 1, 2005
Förlag ELSEVIER

Beskrivning

This article delves into the complex world of scheduling in batch-processing environments where precedence constraints, release dates, and identical processing times pose significant challenges. The authors, T.C.E. Cheng, J.J. Yuan, and A.F. Yang, explore various strategies and methodologies to optimize machine scheduling, ensuring that tasks are executed efficiently while adhering to necessary orderings among them.

Through a comprehensive analysis, the authors investigate the implications of these constraints on operational efficiency. They present detailed models and problem-solving techniques that not only enhance understanding in this domain but also provide practical applications for industries reliant on batch processing. The insights offered in this work are invaluable for researchers and practitioners looking to refine scheduling processes in complex production scenarios.
Lägg till på hyllan

Betygsätt denna bok


Exportera bokjournal