Complexity results for parallel machine problems with a single server
From MaRDI portal
Publication:1860370
DOI10.1002/jos.120zbMath1040.90016OpenAlexW2089814876WikidataQ56920706 ScholiaQ56920706MaRDI QIDQ1860370
Peter Brucker, Clarisse Dhaenens-Flipo, Svetlana A. Kravchenko, Frank Werner, Sigrid Knust
Publication date: 23 February 2003
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.120
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Mixed integer programming formulations for the biomass truck scheduling problem, Minimizing the weighted number of tardy jobs on multiple machines: a review, 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, Scheduling jobs with equal processing times and a single server on parallel identical machines, 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, Online LPT algorithms for parallel machines scheduling with a single server, Scheduling with multiple servers, 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, Single machine scheduling with small operator-non-availability periods, SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS, Minimizing the makespan on two identical parallel machines with mold constraints, Minimizing total weighted completion time approximately for the parallel machine problem with a single server, A survey of scheduling problems with setup times or costs, Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints, A branch-and-price algorithm for the general case of scheduling parallel machines with a single server, MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server, Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic, Complexity results for flow-shop problems with a single server, Parallel machine scheduling with multiple unloading servers, Online algorithms for scheduling two parallel machines with a single server, Scheduling reentrant jobs on parallel machines with a remote server, The single-processor scheduling problem with time restrictions: complexity and related problems, Operator non-availability periods, Scheduling two parallel machines with a single server: the general case, Parallel Machine Scheduling with a Single Server: Loading and Unloading, Single-server parallel-machine scheduling with loading and unloading times
Cites Work
- Parallel machine scheduling problems with a single server
- Parallel machine scheduling with a common server
- Scheduling equal-length jobs on identical parallel machines
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Complexity results for single-machine problems with positive finish-start time-lags
- Scheduling for parallel dedicated machines with a single server
- Unnamed Item
