A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
From MaRDI portal
Publication:1761158
DOI10.1016/j.cor.2011.11.007zbMath1251.90144OpenAlexW2074183570MaRDI QIDQ1761158
Heng-Soon Gan, Andrew Wirth, Amir H. Abdekhodaee
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.007
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
Mixed integer programming formulations for the biomass truck scheduling problem ⋮ A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server ⋮ Block models for scheduling jobs on two parallel machines with a single server ⋮ An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ Scheduling with machine conflicts ⋮ Online algorithms for scheduling two parallel machines with a single server ⋮ Single-server parallel-machine scheduling with loading and unloading times
Cites Work
- Parallel machine scheduling with a common server
- Complexity results for parallel machine problems with a single server
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- A survey of scheduling problems with setup times or costs
- Scheduling two parallel machines with a single server: the general case
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
This page was built for publication: A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
