Pages that link to "Item:Q1593711"
From MaRDI portal
The following pages link to Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711):
Displayed 8 items.
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
- Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Two-machine open shop problem with a single server and set-up time considerations (Q2663040) (← links)
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
- Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)