Scheduling two parallel semiautomatic machines to minimize machine interference
From MaRDI portal
Publication:2563898
DOI10.1016/0305-0548(96)00011-1zbMath0863.90089MaRDI QIDQ2563898
Publication date: 6 January 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(96)00011-1
90B35: Deterministic scheduling theory in operations research
Related Items
SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS, Scheduling parallel machines with a single server: Some solvable cases and heuristics, General variable neighborhood search for the parallel machine scheduling problem with two common servers, Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen, A survey of the machine interference problem, On-line scheduling of two parallel machines with a single server, Parallel machine scheduling problems with a single server, Parallel machine scheduling with multiple unloading servers, Parallel machine scheduling with a common server, 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, Multiprofessor scheduling, MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server, A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times, Equal processing and equal setup time cases of scheduling parallel machines with a single server, Total completion time minimization in a computer system with a server and two parallel processors, Single-server parallel-machine scheduling with loading and unloading times, Mixed integer programming formulations for the biomass truck scheduling problem, A survey of scheduling problems with setup times or costs, Scheduling two parallel machines with a single server: the general case, Online algorithms for scheduling two parallel machines with a single server, An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times
Cites Work
- Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics
- The Single Machine Early/Tardy Problem
- Simultaneous Resource Scheduling to Minimize Weighted Flow Times
- Single-Server, Two-Machine Sequencing with Switching Time
- Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
