Preemptive parallel‐machine scheduling with a common server to minimize makespan

DOI10.1002/NAV.21762zbMath1411.90140OpenAlexW2756007152MaRDI 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

zbMATH Keywords

schedulingparallel machinesmakespanpreemptioncommon server

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

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

This page was built for publication: Preemptive parallel‐machine scheduling with a common server to minimize makespan