An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

DOI10.1016/J.COR.2013.01.018zbMATH Open1348.90305OpenAlexW1997948597MaRDI QIDQ336380FDOQ336380

M. Lozano, C. García-Martínez, Christian Blum, F. 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

Recommendations

• Iterated greedy local search methods for unrelated parallel machine scheduling
• Iterated greedy algorithms for a complex parallel machine scheduling problem
• Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem

zbMATH Keywords

schedulingiterated greedylarge-scale optimisationunrelated parallel machines

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• 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
• Approximations of the critical region of the fbietkan statistic
• Scheduling with deadlines and loss functions
• Scheduling independent tasks to reduce mean finishing time
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Shifting representation search for hybrid flexible flowline problems
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• 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
• Solving Parallel Machine Scheduling Problems by Column Generation
• Note: A local-search heuristic for large set-covering problems
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
• Unrelated parallel machine scheduling using local search
• Nonlinear programming and genetic search application for production scheduling in coal mines
• Solving a chemical batch scheduling problem by local search
• 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
• Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
• Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
• Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Iterated greedy local search methods for unrelated parallel machine scheduling

Cited In (16)

• A new approximation algorithm for unrelated parallel machine scheduling with release dates
• A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
• Population-based iterated greedy algorithm for the S-labeling problem
• Analysis of the similarities and differences of job-based scheduling problems
• A makespan minimization problem for versatile developers in the game industry
• Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times
• Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect
• Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
• 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
• Iterated greedy algorithms for a complex parallel machine scheduling problem
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem

This page was built for publication: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

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