Server scheduling on parallel dedicated machines with fixed job sequences

DOI10.1002/NAV.21846zbMATH Open1418.90106OpenAlexW2941381154WikidataQ127981322 ScholiaQ127981322MaRDI QIDQ5228511FDOQ5228511

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

Publication date: 12 August 2019

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

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

Recommendations

• Scheduling on two parallel machines with two dedicated servers
• Scheduling for parallel dedicated machines with a single server
• Parallel machine scheduling with a single server: loading and unloading
• Single-server parallel-machine scheduling with loading and unloading times
• Scheduling parallel machines with a single server: Some solvable cases and heuristics

zbMATH Keywords

makespanparallel dedicated machinessingle serverfixed job sequence

Mathematics Subject Classification ID

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

Cited In (4)

• Fixed-order scheduling on parallel machines
• Minimization of maximum lateness on parallel machines with a single server and job release dates
• Parallel machine scheduling with multiple unloading servers
• Scheduling on two parallel machines with two dedicated servers

This page was built for publication: Server scheduling on parallel dedicated machines with fixed job sequences

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