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

Authors:
Mateus Rocha de Paula;Geraldo Robson Mateus;Martín Gómez Ravetti
Affiliations:
Universidade Federal de Minas Gerais, Instituto de Ciências Exatas - Departamento de Ciência da Computação, Av. Antônio Carlos, 6627, Pampulha, Belo Horizonte/MG, CEP 3127 ...;Universidade Federal de Minas Gerais, Instituto de Ciências Exatas - Departamento de Ciência da Computação, Av. Antônio Carlos, 6627, Pampulha, Belo Horizonte/MG, CEP 3127 ...;Centre for Bioinformatics, Biomarker Discovery, and Information-Based Medicine, School of Electrical Engineering and Computer Science, The University of Newcastle, University Drive, Callaghan, NSW ...
Venue:
Computers and Operations Research
Year:
2010

Citing 7
Cited 0

A time indexed formulation of non-preemptive single machine scheduling problems

Mathematical Programming: Series A and B
Lagrangian relaxation

Modern heuristic techniques for combinatorial problems
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

INFORMS Journal on Computing
Scheduling unrelated parallel machines to minimize total weighted tardiness

Computers and Operations Research
Scheduling Algorithms

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

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Consider the problem of scheduling a set of jobs to be processed exactly once, on any machine of a set of unrelated parallel machines, without preemption. Each job has a due date, weight, and, for each machine, an associated processing time and sequence-dependent setup time. The objective function considered is to minimize the total weighted tardiness of the jobs. This work proposes a non-delayed relax-and-cut algorithm, based on a Lagrangean relaxation of a time indexed formulation of the problem. A Lagrangean heuristic is also developed to obtain approximate solutions. Using the proposed methods, it is possible to obtain optimal solutions within reasonable time for some instances with up to 180 jobs and six machines. For the solutions for which it is not possible to prove optimality, interesting gaps are obtained.