Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability
From MaRDI portal
Publication:1578308
zbMath0957.68011MaRDI QIDQ1578308
Wiesław X. Kubiak, Günter Schmidt, Jacek Błażewicz, Piotr Formanowicz, M. Przysucha
Publication date: 22 November 2000
Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Minimizing the makespan for the flow shop scheduling problem with availability constraints., Scheduling with limited machine availability, An improved heuristic for two-machine flowshop scheduling with an availability constraint
