On Minimizing Total Tardiness in a Serial Batching Problem

DOI10.1051/ro:2001105zbMath0991.90062OpenAlexW2068166158MaRDI QIDQ2765603

Antoine Jouglet, Philippe Baptiste

Publication date: 25 August 2002

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

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

zbMATH Keywords

dynamic programmingtotal tardinessscheduling of jobspseudopolynomial algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Optimally competitive list batching, A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates, A survey of scheduling problems with setup times or costs

Cites Work

• Batch sizing and job sequencing on a single machine
• Scheduling a batching machine
• The complexity of one-machine batching problems
• Batching identical jobs
• Scheduling with batching: A review
• Minimizing Total Tardiness on One Machine is NP-Hard
• On the Complexity of Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine
• Unnamed Item
• Unnamed Item
• Unnamed Item