Iterated greedy local search methods for unrelated parallel machine scheduling

DOI10.1016/j.ejor.2010.03.030zbMath1205.90121MaRDI QIDQ992577

Rubén Ruiz, Luis Fanjul-Peyro

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.030

zbMATH Keywords

local search; makespan; unrelated parallel machines; iterated greedy

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Related Items

SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING, An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem, Minimizing resource consumption on uniform parallel machines with a bound on makespan, Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem, Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent, A variable iterated greedy algorithm for the traveling salesman problem with time windows, ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times, An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes, Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times, Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows, The weighted independent domination problem: integer linear programming models and metaheuristic approaches, A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem, Exact methods for order acceptance and scheduling on unrelated parallel machines, Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources, An iterated greedy heuristic for a market segmentation problem with multiple attributes, Heuristics for a flowshop scheduling problem with stepwise job objective function, Scheduling unrelated parallel machines with optional machines and jobs selection, A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility, Local search methods for the flowshop scheduling problem with flowtime minimization, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, Uniform parallel machine scheduling with resource consumption constraint, Bi-objective parallel machine scheduling with additional resources during setups, Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect, Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling, Iterated greedy algorithms for a complex parallel machine scheduling problem, Exact makespan minimization of unrelated parallel machines, Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem, An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics, Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem, Iterated greedy for the maximum diversity problem, Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling, Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints, A comparative study of solution representations for the unrelated machines environment, The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A state-of-the-art review of parallel-machine scheduling research
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• Heuristic algorithms for the portfolio selection problem with minimum transaction lots
• An approximation algorithm for the generalized assignment problem
• On practical resource allocation for production planning and scheduling with period overlapping setups
• Unrelated parallel machine scheduling using local search
• A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• Variable neighborhood search
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• A cutting plane algorithm for the unrelated parallel machine scheduling problem
• Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
• Heuristics for scheduling unrelated parallel machines
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Scheduling with Deadlines and Loss Functions
• An effective heuristic for minimising makespan on 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
• Planning and Scheduling in Manufacturing and Services
• Scheduling Unrelated Parallel Machines Computational Results
• Bounds on Multiprocessing Timing Anomalies
• Scheduling
• Variable neighborhood search: Principles and applications
• Scheduling tasks on unrelated machines: large neighborhood improvement procedures