MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

DOI10.1016/j.cor.2011.12.011zbMath1251.90156OpenAlexW1965212320MaRDI QIDQ1761182

Young Hoon Lee, Mi-Yi Kim

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.12.011

zbMATH Keywords

schedulingparallel machinessingle serverMIP

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

Mixed integer programming formulations for the biomass truck scheduling problem ⋮ 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 ⋮ Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm ⋮ An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times ⋮ 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 with machine conflicts ⋮ SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS ⋮ Online algorithms for scheduling two parallel machines with a single server ⋮ The single-processor scheduling problem with time restrictions: complexity and related problems ⋮ Single-server parallel-machine scheduling with loading and unloading times

Cites Work

• Scheduling with multiple servers
• A survey of the machine interference problem
• Sequencing and scheduling in robotic cells: recent developments
• Parallel machine scheduling problems with a single server
• Parallel machine scheduling with multiple unloading servers
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Parallel machine scheduling with a common 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
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
• Scheduling two parallel semiautomatic machines to minimize machine interference
• Scheduling two parallel machines with a single server: the general case
• Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
• Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot
• Sequencing of robot activities and parts in two-machine robotic cells
• Scheduling for parallel dedicated machines with a single server
• An approximation algorithm for parallel machine scheduling with a common server
• Minimizing makespan on parallel machines with release time and machine eligibility restrictions
• Scheduling parallel machines with a single server: Some solvable cases and heuristics

This page was built for publication: MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server