Scheduling identical jobs with chain precedence constraints on two uniform machines
From MaRDI portal
Publication:1974574
zbMath0941.90019MaRDI QIDQ1974574
Peter Brucker, Wiesław X. Kubiak, Johann L. Hurink
Publication date: 7 May 2000
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Queues and service in operations research (90B22)
Related Items
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, Unnamed Item, A metric approach for scheduling problems with minimizing the maximum penalty, A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints, Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan, Ideal schedules in parallel machine settings, Fast LP models and algorithms for identical jobs on uniform parallel machines
