Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization

DOI10.1007/978-1-4614-1123-9_4zbMath1355.90032OpenAlexW204247932MaRDI QIDQ2958668

Rubén Ruiz, Eva Vallada

Publication date: 3 February 2017

Published in: Just-in-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-1123-9_4

Mathematics Subject Classification ID

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

Related Items (7)

Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times ⋮ On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications ⋮ Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Just-in-time scheduling for a distributed concrete precast flow shop system ⋮ Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• Scheduling unrelated parallel machines with sequence-dependent setups
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
• A state-of-the-art review of parallel-machine scheduling research
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Parallel machine scheduling with earliness and tardiness penalties
• A genetic algorithm for flowshop sequencing
• A tabu search algorithm for parallel machine total tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• Exponential neighborhood search for a parallel machine scheduling problem
• The significance of reducing setup times/setup costs
• A survey of scheduling problems with setup times or costs
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• Scheduling with Deadlines and Loss Functions
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing the sum of job earliness and tardiness in a multimachine system
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Survey of scheduling research involving setup times
• A genetic algorithm for flow shop scheduling problems

This page was built for publication: Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization