Pages that link to "Item:Q1388828"
From MaRDI portal
The following pages link to A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828):
Displayed 6 items.
- On scheduling around large restrictive common due windows (Q704121) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- The general lotsizing and scheduling problem (Q1374405) (← links)
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem (Q1885997) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS (Q3631235) (← links)
