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

Authors:
Pedro Leite Rocha;Martín Gómez Ravetti;Geraldo Robson Mateus;Panos M. Pardalos
Affiliations:
Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Brazil;Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Brazil;Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Brazil;Department of Industrial and Systems Engineering, University of Florida, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 9
Cited 11

Introduction to algorithms

Introduction to algorithms
A GRASP for a difficult single machine scheduling problem

Computers and Operations Research
A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties

Computers and Operations Research
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing
Scheduling Algorithms

Scheduling Algorithms
A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

Computers and Operations Research

Planning production using mathematical programming: The case of a woodturning company

Computers and Operations Research
A fuzzy-mixed-integer goal programming model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates

Robotics and Computer-Integrated Manufacturing
Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

Computers and Operations Research
A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times

Computers and Operations Research
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Journal of Intelligent Manufacturing
Integrating parts design characteristics and scheduling on parallel machines

Expert Systems with Applications: An International Journal
Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints

Computers and Operations Research
Sequence-dependent group scheduling problem on unrelated-parallel machines

Expert Systems with Applications: An International Journal
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

Journal of Intelligent Manufacturing
Makespan minimization for scheduling unrelated parallel machines with setup times

Journal of Intelligent Manufacturing
Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

A scheduling problem with unrelated parallel machines, sequence and machine-dependent setup times, due dates and weighted jobs is considered in this work. A branch-and-bound algorithm (B&B) is developed and a solution provided by the metaheuristic GRASP is used as an upper bound. We also propose a set of instances for this type of problem. The results are compared to the solutions provided by two mixed integer programming models (MIP) with the solver CPLEX 9.0. We carry out computational experiments and the algorithm performs extremely well on instances with up to 30 jobs.