GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
From MaRDI portal
Publication:1945095
DOI10.1007/s10479-012-1164-8zbMath1260.90096OpenAlexW2082168200MaRDI QIDQ1945095
Christian Blum, Manuel Lozano, Carlos García-Martínez, Francisco J. Rodriguez
Publication date: 2 April 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1164-8
metaheuristicsGRASPpath-relinkingnon-identical parallel machine scheduling problem with minimising total weighted completion times
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, An exact extended formulation for the unrelated parallel machine total weighted completion time 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, Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing, Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry, A new approximation algorithm for unrelated parallel machine scheduling with release dates, Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- A state-of-the-art review of parallel-machine scheduling research
- Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
- 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
- GRASP and path relinking for the max-min diversity problem
- 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
- A probabilistic heuristic for a computationally difficult set covering problem
- Scheduling identical parallel machines to minimize total weighted completion time
- 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
- Scheduling unrelated parallel machines with optional machines and jobs selection
- Greedy randomized adaptive search procedures
- On the minimization of total weighted flow time with identical and uniform parallel machines
- A hybrid heuristic for the \(p\)-median problem
- Scheduling a round robin tennis tournament under courts and players availability constraints
- 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
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
- GRASP with Path Relinking for Three-Index Assignment
- Convex quadratic and semidefinite programming relaxations in scheduling
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- Approximations of the critical region of the fbietkan statistic
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Task Scheduling in Networks
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Solving Parallel Machine Scheduling Problems by Column Generation
- Scheduling independent tasks to reduce mean finishing time
- Scheduling Unrelated Machines by Randomized Rounding
- A GRASP with path-relinking for private virtual circuit routing
- Scheduling with parallel processors and linear delay costs
