Pages that link to "Item:Q1341398"
From MaRDI portal
The following pages link to Unrelated parallel machine scheduling using local search (Q1341398):
Displayed 11 items.
- Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search (Q1362228) (← links)
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
- Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
- Exploiting process plan flexibility in production scheduling: A multi-objective approach (Q1809824) (← links)
- Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)