Tabu search and lower bound for an industrial complex shop scheduling problem

Authors:
D. Prot;O. Bellenguez-Morineau
Affiliations:
LUNAM Université, ícole des Mines de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communication et en Cybernétique de Nantes), 4 rue Alfred Kastler, La Chantrerie, BP20722 ...;LUNAM Université, ícole des Mines de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communication et en Cybernétique de Nantes), 4 rue Alfred Kastler, La Chantrerie, BP20722 ...
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 11
Cited 0

Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Approximation Algorithms for Flexible Job Shop Problems

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Satisfying due-dates in the presence of sequence dependent family setups with a special comedown structure

Computers and Industrial Engineering
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems

Computers and Operations Research
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Job shop scheduling with setup times, deadlines and precedence constraints

Journal of Scheduling
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan

Future Generation Computer Systems
Flexible job-shop scheduling with parallel variable neighborhood search algorithm

Expert Systems with Applications: An International Journal
Discrepancy search for the flexible job shop scheduling problem

Computers and Operations Research
Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with an industrial shop scheduling problem that arises in a metal goods production group. The scheduling problem can be seen as a multi-mode job shop with assembly. Jobs have additional constraints such as release date, due date and sequence-dependent setup times. The aim of the decision-makers is to minimize the maximum lateness. This article introduces a tabu search procedure to solve the whole problem and a valid lower bound used to evaluate the tabu search procedure.