An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
From MaRDI portal
Publication:336380
DOI10.1016/j.cor.2013.01.018zbMath1348.90305OpenAlexW1997948597MaRDI QIDQ336380
Manuel Lozano, Carlos García-Martínez, Christian Blum, Francisco J. Rodriguez
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.018
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
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 ⋮ GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines ⋮ Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem ⋮ Analysis of the similarities and differences of job-based scheduling problems ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates ⋮ Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Shifting representation search for hybrid flexible flowline problems
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Unrelated parallel machine scheduling using local search
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Nonlinear programming and genetic search application for production scheduling in coal mines
- Solving a chemical batch scheduling problem by local search
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- On the minimization of total weighted flow time with identical and uniform parallel machines
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Scheduling a round robin tennis tournament under courts and players availability constraints
- Iterated greedy for the maximum diversity problem
- A genetic approach for solving a scheduling problem in a robotized analytical system
- Scheduling with Deadlines and Loss Functions
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
- Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
- Approximations of the critical region of the fbietkan statistic
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- Solving Parallel Machine Scheduling Problems by Column Generation
- Scheduling independent tasks to reduce mean finishing time
- Note: A local-search heuristic for large set-covering problems
