Heuristic scheduling of parallel machines with sequence-dependent set-up times

DOI10.1080/00207540110064938zbMath1114.90355OpenAlexW2140277377MaRDI QIDQ4443334

Mary E. Kurz, Ronald G. Askin

Publication date: 11 January 2004

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

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

Mathematics Subject Classification ID

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

Related Items (12)

Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach ⋮ A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times ⋮ Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints ⋮ Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times ⋮ Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization ⋮ Scheduling continuous aluminium casting lines ⋮ A survey of scheduling problems with setup times or costs ⋮ Scheduling identical parallel machines with tooling constraints ⋮ A single machine scheduling problem with availability constraints and sequence-dependent setup costs ⋮ A multi-period machine assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• Scheduling batches on parallel machines with major and minor set-ups
• New algorithms for an ancient scheduling problem.
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• Minmax combinatorial optimization
• Solving makespan minimization problems with Lagrangean decomposition
• The \(k\)-partitioning problem
• Parallel machine scheduling with earliness and tardiness penalties
• Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
• The traveling salesman. Computational solutions for RSP applications
• Scheduling with Deadlines and Loss Functions
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• On scheduling parallel machines with two setup classes
• Algorithms for Scheduling Independent Tasks
• An Application of Bin-Packing to Multiprocessor Scheduling
• On the Complexity of Scheduling with Batch Setup Times
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Optimal Preemptive Scheduling on Two-Processor Systems
• Bounds on Multiprocessing Timing Anomalies
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

This page was built for publication: Heuristic scheduling of parallel machines with sequence-dependent set-up times