Pages that link to "Item:Q1374421"
From MaRDI portal
The following pages link to Single machine scheduling with batch set-up times to minimize maximum lateness (Q1374421):
Displaying 14 items.
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384) (← links)
- Minimizing maximum lateness with job families (Q1590808) (← links)
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← 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 the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347) (← links)
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs (Q2464440) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
- Minimizing <i>L</i> <sub>max</sub> for the single machine scheduling problem with family set-ups (Q4671323) (← links)
