Pages that link to "Item:Q1976518"
From MaRDI portal
The following pages link to Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518):
Displaying 10 items.
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs (Q2464440) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← 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)
- Online Machine Scheduling with Family Setups (Q2821094) (← links)
