Scheduling two parallel machines with a single server: the general case
From MaRDI portal
Publication:2571191
DOI10.1016/J.COR.2004.08.013zbMATH Open1079.90043OpenAlexW2085508662MaRDI QIDQ2571191FDOQ2571191
Authors: Amir Abdekhodaee, Andrew Wirth, Heng-Soon Gan 
Publication date: 1 November 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.08.013
Recommendations
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
- Scheduling for parallel dedicated machines with a single server
- Parallel machine scheduling problems with a single server
Cites Work
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- 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
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- Scheduling two parallel semiautomatic machines to minimize machine interference
Cited In (26)
- Scheduling with machine conflicts
- Schedule-allocate and robust sequencing in three-machine robotic cell under breakdowns
- Online algorithms for scheduling two parallel machines with a single server
- On-line scheduling of two parallel machines with a single server
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times
- 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
- Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times
- General variable neighborhood search for the parallel machine scheduling problem with two common servers
- 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
- Heuristics for the two-machine scheduling problem with a single server
- Block models for scheduling jobs on two parallel machines with a single server
- Parallel machine scheduling with multiple unloading servers
- A survey of scheduling problems with setup times or costs
- Parallel machine scheduling with a single server: loading and unloading
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- 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
- Single-server parallel-machine scheduling with loading and unloading times
- A two-class parallel system with general service times of the parallel class
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
- Unknown Input Observers Designed by Eigenstructure Assignment
This page was built for publication: Scheduling two parallel machines with a single server: the general case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571191)
