A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
From MaRDI portal
Publication:1362228
DOI10.1016/0895-7177(96)00150-1zbMath0882.68017OpenAlexW2009567024WikidataQ126421031 ScholiaQ126421031MaRDI QIDQ1362228
Publication date: 4 February 1998
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/67997
Related Items (12)
A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups ⋮ Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem ⋮ Scheduling unrelated parallel machines with sequence-dependent setups ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system ⋮ Scheduling of unrelated parallel manufacturing cells with limited human resources ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling ⋮ Capacity-constrained scheduling for a logic IC final test facility ⋮ Workload balancing and loop layout in the design of a flexible manufacturing system ⋮ A cutting plane algorithm for the unrelated parallel machine scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Unrelated parallel machine scheduling using local search
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Heuristics for scheduling unrelated parallel machines
- Algorithms for Scheduling Tasks on Unrelated Processors
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
This page was built for publication: A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search