Scheduling unrelated parallel machines with sequence-dependent setups

DOI10.1016/j.cor.2006.02.006zbMath1127.90032OpenAlexW2033494440MaRDI QIDQ883307

Rasaratnam Logendran, Brent McDonell, Byran J. Smucker

Publication date: 4 June 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.006

zbMATH Keywords

tabu searchsequence-dependent setupsunrelated parallel machine scheduling

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items (18)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study ⋮ 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 ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ A comparative study of solution representations for the unrelated machines environment ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization ⋮ Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm ⋮ An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics ⋮ A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times ⋮ Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines ⋮ Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines ⋮ Planning production using mathematical programming: The case of a woodturning company ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• Minimizing the number of tardy jobs for \(m\) parallel machines
• Unrelated parallel machine scheduling using local search
• A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• A tabu search algorithm for parallel machine total tardiness problem
• Heuristics for scheduling unrelated parallel machines
• An effective heuristic for minimising makespan on unrelated parallel machines
• The Single Machine Early/Tardy Problem
• Algorithms for Scheduling Tasks on Unrelated Processors
• The Total Tardiness Problem: Review and Extensions
• Heuristics for minimizing mean tardiness form parallel machines

This page was built for publication: Scheduling unrelated parallel machines with sequence-dependent setups