Pages that link to "Item:Q1273118"
From MaRDI portal
The following pages link to Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time (Q1273118):
Displayed 7 items.
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
- Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs (Q2370330) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)