A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

DOI10.1016/0895-7177(96)00150-1MaRDI QIDQ1362228zbMATH OpenOpenAlexWikidataFDO

Authors W. van Dijk, Nanda Piersma

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

zbMATH Keywords

parallel machine scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Iterated greedy local search methods for unrelated parallel machine scheduling
• Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
• Unrelated parallel machine scheduling using local search
• scientific article; zbMATH DE number 1082109
• Running time of local search algorithms for a scheduling problem on the parallel machines

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 1054936 (Why is no real title available?)
• Algorithms for Scheduling Tasks on Unrelated Processors
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• Approximation algorithms for scheduling unrelated parallel machines
• Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Heuristics for scheduling unrelated parallel machines
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• Unrelated parallel machine scheduling using local search

Cited in

(20)

• Scheduling of unrelated parallel manufacturing cells with limited human resources
• A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups
• Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system
• An effective heuristic for minimising makespan on unrelated parallel machines
• Scheduling tasks on unrelated machines: large neighborhood improvement procedures
• Global Search Method for Parallel Machine Scheduling
• Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
• Workload balancing and loop layout in the design of a flexible manufacturing system
• A local search using solution fragments for the 2-machine bicriteria scheduling problem
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Running time of local search algorithms for a scheduling problem on the parallel machines
• Unrelated parallel machine scheduling using local search
• Capacity-constrained scheduling for a logic IC final test facility
• Scheduling unrelated parallel machines with sequence-dependent setups
• A cutting plane algorithm for the unrelated parallel machine scheduling problem
• Unrelated parallel machine scheduling -- perspectives and progress
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• 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
• Exponential neighborhood search for a parallel machine scheduling problem

This page was built for publication: A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362228)