Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times

DOI10.1016/0167-6377(93)90089-YzbMath0804.90074MaRDI QIDQ1318658

Reha Uzsoy, Irfan M. Ovacik

Publication date: 6 April 1994

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

heuristicsmakespansequence-dependent setup timesmaximum latenessparallel identical machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints ⋮ Scheduling of multi-spindle CNC gantry mills ⋮ List scheduling revisited ⋮ Bounds for parallel machine scheduling with predefined parts of jobs and setup time ⋮ The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds ⋮ Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers ⋮ Heuristic scheduling of parallel machines with sequence-dependent set-up times ⋮ Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling batches on parallel machines with major and minor set-ups
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Bounds for naive multiple machine scheduling with release times and deadlines
• SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS
• P-Complete Approximation Problems
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times