Pages that link to "Item:Q1417509"
From MaRDI portal
The following pages link to A repairing technique for the local search of the job-shop problem. (Q1417509):
Displaying 6 items.
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- A sorting based efficient heuristic for pooled repair shop designs (Q2297570) (← links)
- A disjunctive graph model and framework for constructing new train schedules (Q2379528) (← links)
- Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)