Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

DOI10.1016/j.cor.2006.07.015zbMath1169.90010MaRDI QIDQ941547

Panos M. Pardalos, Geraldo Robson Mateus, Martín Gómez Ravetti, Pedro Leite Rocha

Publication date: 1 September 2008

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

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

zbMATH Keywords

scheduling; parallel machines; branch-and-bound; GRASP; sequence-dependent setups; machine-dependent setups

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints, An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, Planning production using mathematical programming: The case of a woodturning company, A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the number of tardy jobs for \(m\) parallel machines
• A GRASP for a difficult single machine scheduling problem
• Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
• Simultaneous lotsizing and scheduling on parallel machines
• Greedy randomized adaptive search procedures
• Makespan minimization on uniform parallel machines with release times
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
• Impact of sequence-dependent setup time on job shop scheduling performance
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization