Unrelated parallel machine scheduling using local search

DOI10.1016/0895-7177(94)90205-4zbMath0810.90066OpenAlexW1968762474MaRDI QIDQ1341398

P. Shade, Celia A. Dr. Glass, Chris N. Potts

Publication date: 11 January 1995

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(94)90205-4

zbMATH Keywords

approximate solutionssimulated annealinggenetic algorithmslocal searchunrelated parallel machinesmaximum completion timehybrid methodtaboo search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (28)

Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times ⋮ A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search ⋮ Exact makespan minimization of unrelated parallel machines ⋮ A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ A comparative study of solution representations for the unrelated machines environment ⋮ Scheduling unrelated parallel machines with sequence-dependent setups ⋮ A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems ⋮ Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ Lexicographic local search and the \(p\)-center problem. ⋮ Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing ⋮ Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information ⋮ Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling ⋮ Decomposition Methods for the Parallel Machine Scheduling Problem with Setups ⋮ Exploiting process plan flexibility in production scheduling: A multi-objective approach ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ 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
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• An improved annealing scheme for the QAP
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Simulated annealing: A tool for operational research
• Some efficient heuristic methods for the flow shop sequencing problem
• Worst-case analysis of a scheduling algorithm
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• A new heuristic method for the flow shop sequencing problem
• Genetic local search in combinatorial optimization
• The tabu search metaheuristic: How we used it
• Genetic algorithms: Foundations and applications
• Future paths for integer programming and links to artificial intelligence
• Heuristics for scheduling unrelated parallel machines
• Applying tabu search to the job-shop scheduling problem
• Convergence of an annealing algorithm
• Algorithms for Scheduling Tasks on Unrelated Processors
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• 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
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems

This page was built for publication: Unrelated parallel machine scheduling using local search