Pages that link to "Item:Q3366367"
From MaRDI portal
The following pages link to A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems (Q3366367):
Displaying 11 items.
- Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective'' (Q336632) (← links)
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- A simulated annealing approach for the one-machine mean tardiness scheduling problem (Q1268192) (← links)
- Optimal and heuristic solutions for a scheduling problem arising in a foundry (Q1772868) (← links)
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems (Q2792203) (← links)
- A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS (Q3573666) (← links)
- An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm (Q4546893) (← links)
- Artificial Intelligence and Soft Computing - ICAISC 2004 (Q4666243) (← links)
- (Q5399868) (← links)
