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

DOI10.1016/S0167-6377(00)00040-7MaRDI QIDQ1593711zbMATH OpenWikidataFDO

Authors 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 complexitydynamic programmingschedulingbatchinglateness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7070855
• Batch scheduling to minimize maximum lateness
• Scheduling a batching machine
• Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan

Cites work

• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Batch sizing and job sequencing on a single machine
• Batching in single operation manufacturing systems
• 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
• Scheduling a batching machine
• Scheduling the production of two-component jobs on a single machine
• Scheduling with batching: A review
• The complexity of one-machine batching problems
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions

Cited in

(10)

• scientific article; zbMATH DE number 7070855 (Why is no real title available?)
• Solving the two-machine open shop problem with a single server with respect to the makespan
• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
• Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
• Two-machine open shop problem with a single server and set-up time considerations
• Split-merge: using exponential neighborhood search for scheduling a batching machine
• A survey of scheduling problems with setup times or costs
• Unbounded parallel-batching scheduling with two competitive agents
• A new effective dynamic program for an investment optimization problem
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

This page was built for publication: Improved dynamic programs for some batching problems involving the maximum lateness criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593711)