Pages that link to "Item:Q1373461"
From MaRDI portal
The following pages link to Batch scheduling to minimize maximum lateness (Q1373461):
Displaying 14 items.
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324) (← links)
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan (Q880565) (← 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)
- MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963) (← links)
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827) (← links)
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Scheduling the production of two-component jobs on a single machine (Q1969827) (← links)
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times (Q2094381) (← links)
- Single machine batch scheduling with non-increasing time slot costs (Q2673533) (← links)
- Single machine scheduling to minimize the setup time and the earliness (Q3411902) (← links)
