Preemptive parallel‐machine scheduling with a common server to minimize makespan
From MaRDI portal
Publication:4632980
DOI10.1002/nav.21762zbMath1411.90140MaRDI QIDQ4632980
Cheng, T. C. Edwin, Svetlana A. Kravchenko, Bertrand M. T. Lin
Publication date: 2 May 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21762
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Efficient algorithms for flexible job shop scheduling with parallel machines, Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers