A heuristic approach for single-machine scheduling with due dates and class setups.

DOI10.1016/S0305-0548(00)00031-9zbMath1081.90560OpenAlexW2095879692MaRDI QIDQ5945318

Jason Chao-Hsien Pan, Hung-Liang Cheng, Jen-Shiang Chen

Publication date: 31 October 2002

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00031-9

zbMATH Keywords

SchedulingSequence-independent setupSingle machine

Mathematics Subject Classification ID

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

Related Items

A survey of scheduling problems with setup times or costs, A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups

Cites Work

• Unnamed Item
• Unnamed Item
• Single facility multi-class job scheduling
• Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
• Scheduling two job classes on a single machine
• Scheduling tasks with sequence-dependent processing times
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Minimizing maximum lateness on one machine: computational experience and some applications
• A dual algorithm for the one-machine scheduling problem
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• On the Complexity of Scheduling with Batch Setup Times
• A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
• Scheduling Groups of Jobs on a Single Machine
• Minimum Change-Over Scheduling of Several Products on One Machine
• Single-Server, Two-Machine Sequencing with Switching Time