Preemptive scheduling with finite capacity input buffers

DOI10.1023/A:1018990625142zbMath0889.90087OpenAlexW203784335MaRDI QIDQ1374452

Nicholas G. Hall, Marc E. Posner, Chris N. Potts

Publication date: 4 December 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018990625142

zbMATH Keywords

polynomial time algorithmfinite input bufferspreemptive single machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

This page was built for publication: Preemptive scheduling with finite capacity input buffers