Improved dynamic programs for some batching problems involving the maximum lateness criterion

DOI10.1016/S0167-6377(00)00040-7zbMath0969.90049WikidataQ127613622 ScholiaQ127613622MaRDI QIDQ1593711

A. E. Gerodimos, Albert P. M. Wagelmans

Publication date: 4 October 2001

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

zbMATH Keywords

computational complexityschedulingdynamic programminglatenessbatching

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness ⋮ Split-merge: using exponential neighborhood search for scheduling a batching machine ⋮ Two-machine open shop problem with a single server and set-up time considerations ⋮ Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions ⋮ A survey of scheduling problems with setup times or costs ⋮ A new effective dynamic program for an investment optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Batching in single operation manufacturing systems
• Scheduling a batching machine
• The complexity of one-machine batching problems
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
• Scheduling with batching: A review
• Scheduling the production of two-component jobs on a single machine
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Improved Algorithms for Economic Lot Size Problems
• Scheduling Groups of Jobs on a Single Machine