Pages that link to "Item:Q1362228"
From MaRDI portal
The following pages link to A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search (Q1362228):
Displaying 12 items.
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information (Q473662) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← 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 novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups (Q2642312) (← links)
- Capacity-constrained scheduling for a logic IC final test facility (Q4474709) (← links)
- Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system (Q5438649) (← links)
- Scheduling of unrelated parallel manufacturing cells with limited human resources (Q5444619) (← links)
