Scheduling two parallel semiautomatic machines to minimize machine interference

DOI10.1016/0305-0548(96)00011-1zbMath0863.90089OpenAlexW1975172002MaRDI QIDQ2563898

Christos P. Koulamas

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

zbMATH Keywords

strongly NP-hardscheduling two parallel semiautomatic machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (21)

Mixed integer programming formulations for the biomass truck scheduling problem ⋮ 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 ⋮ 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 ⋮ A survey of the machine interference problem ⋮ An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times ⋮ Multiprofessor scheduling ⋮ 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 ⋮ SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS ⋮ A survey of scheduling problems with setup times or costs ⋮ On-line scheduling of two parallel machines with a single server ⋮ MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server ⋮ Parallel machine scheduling problems with a single server ⋮ Parallel machine scheduling with multiple unloading servers ⋮ Scheduling parallel machines with a single server: Some solvable cases and heuristics ⋮ A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times ⋮ Online algorithms for scheduling two parallel machines with a single server ⋮ Parallel machine scheduling with a common server ⋮ Scheduling two parallel machines with a single server: the general case ⋮ 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

This page was built for publication: Scheduling two parallel semiautomatic machines to minimize machine interference