The following pages link to (Q4891488):
Displaying 13 items.
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms (Q342413) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- Some new results on simulated annealing applied to the job shop scheduling problem (Q1806648) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)
- Supercomputer Scheduling with Combined Evolutionary Techniques (Q3603111) (← links)
