Pages that link to "Item:Q1013384"
From MaRDI portal
The following pages link to A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384):
Displaying 13 items.
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
- Temporary workforce planning with firm contracts: a model and a simulated annealing heuristic (Q541451) (← links)
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
- Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
- A simulated annealing approach for the one-machine mean tardiness scheduling problem (Q1268192) (← links)
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← links)
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs (Q2225197) (← links)
- A simulated annealing approach to bicriteria scheduling problems on a single machine (Q2567887) (← links)
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
- Single machine scheduling with sequence-dependent family setups to minimize maximum lateness (Q3585727) (← links)
- (Q3641992) (← links)
