Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine

DOI10.1051/RO:2001110zbMath1049.90022OpenAlexW1964928578MaRDI QIDQ2773167

Philippe Chrétienne

Publication date: 2001

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_2_165_0

zbMATH Keywords

complexityalgorithmscheduling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Cites Work

• A survey of the state-of-the-art of common due date assignment and scheduling research
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• Sequencing with Earliness and Tardiness Penalties: A Review
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs

This page was built for publication: Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine