Pages that link to "Item:Q5932283"
From MaRDI portal
The following pages link to Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283):
Displayed 6 items.
- Scheduling and constraint propagation (Q697570) (← links)
- Local adjustments: A general algorithm (Q707084) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
