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

DOI10.1002/NAV.21762MaRDI QIDQ4632980zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, Svetlana A. Kravchenko, B. M. T. Lin

Publication date 2 May 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.21762

zbMATH Keywords

common servermakespanparallel machinespreemptionscheduling

Mathematics Subject Classification ID

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

Recommendations

• Parallel machine scheduling with a common server
• Complexity of preemptive minsum scheduling on unrelated parallel machines
• An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times
• scientific article; zbMATH DE number 1757970
• Parallel machine scheduling problems with a single server

Cited in

(7)

• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
• An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times
• Efficient algorithms for flexible job shop scheduling with parallel machines
• Minimization of maximum lateness on parallel machines with a single server and job release dates
• A reduction approach for the parallel machine scheduling problem with a separate server for loading and unloading operations
• Scheduling fully parallel jobs with integer units
• Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632980)