Parallel machine scheduling problems with a single server
From MaRDI portal
Publication:969356
DOI10.1016/S0895-7177(97)00236-7zbMATH Open1185.90082WikidataQ57633986 ScholiaQ57633986MaRDI QIDQ969356FDOQ969356
Authors: Frank Werner, Svetlana A. Kravchenko
Publication date: 6 May 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Recommendations
- Scheduling with multiple servers
- Complexity results for parallel machine problems with a single server
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- Scheduling for parallel dedicated machines with a single server
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
Cites Work
Cited In (37)
- Scheduling with machine conflicts
- Online algorithms for scheduling two parallel machines with a single server
- On-line scheduling of two parallel machines with a single server
- Scheduling two parallel machines with a single server: the general case
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
- An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times
- Scheduling for parallel dedicated machines with a single server
- Total completion time minimization in a computer system with a server and two parallel processors
- 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
- Dual processes to solve single server systems
- Preemptive parallel-machine scheduling with a common server to minimize makespan
- The single-processor scheduling problem with time restrictions: complexity and related problems
- Scheduling jobs with equal processing times and a single server on parallel identical machines
- Scheduling reentrant jobs on parallel machines with a remote server
- Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen
- Minimization of maximum lateness on parallel machines with a single server and job release dates
- Parallel machine scheduling with multiple unloading servers
- A survey of scheduling problems with setup times or costs
- Scheduling with multiple servers
- Parallel machine scheduling with a single server: loading and unloading
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- Discrete parallel machine makespan ScheLoc problem
- Parallel machine scheduling with a common server
- A heuristic algorithm for minimizing mean flow time with unit setups
- On the minimum number of resources for a perfect schedule
- Complexity results for flow-shop problems with a single 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
- Mixed integer programming formulations for the biomass truck scheduling problem
- Scheduling on two parallel machines with two dedicated servers
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
- Single-server parallel-machine scheduling with loading and unloading times
- Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers
- Parallel Machine Scheduling with Batch Setup Times
- Online LPT algorithms for parallel machines scheduling with a single server
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
This page was built for publication: Parallel machine scheduling problems with a single server
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969356)