Minimizing makespan on parallel machines with release time and machine eligibility restrictions

DOI10.1080/00207540310001631584zbMath1176.90155OpenAlexW2074886917MaRDI QIDQ4823576

Robert L. Armacost, Griselle Centeno

Publication date: 28 October 2004

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540310001631584

zbMATH Keywords

heuristicsminimizing makespanindustry

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (14)

Parallel machine scheduling with preference of machines ⋮ Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions ⋮ Parallel machine scheduling with machine availability and eligibility constraints ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ A two-stage flow shop scheduling problem with transportation considerations ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server ⋮ Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness

Cites Work

• Scheduling on identical machines: How good is LPT in an on-line setting?
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing makespan on parallel machines with release time and machine eligibility restrictions