HAL: hal-00022742, version 1

arXiv: cs.CC/0606043

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

Annals of Operations Research 138 (2005) 21-52

Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis

Christian ARTIGUES 1, Pierre Lopez 2, Pierre-Dimitri Ayache 1

(2005)

We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances.

1:	Laboratoire Informatique d'Avignon (LIA)
	Université d'Avignon – Centre d'Enseignement et de Recherche en Informatique - CERI
2:	Laboratoire d'analyse et d'architecture des systèmes (LAAS)
	CNRS : UPR8001 – Université Paul Sabatier [UPS] - Toulouse III – Institut National Polytechnique de Toulouse - INPT – Institut National des Sciences Appliquées (INSA) - Toulouse

Research team: LAAS-MOGISA

Subject

:

Computer Science/Computational Complexity Mathematics/Combinatorics Computer Science/Operations Research

Keyword(s): scheduling theory – job-shop – sequence-dependent setup times – schedule generation scheme – dominance properties – priority rules

hal-00022742, version 1

http://hal.archives-ouvertes.fr/hal-00022742

oai:hal.archives-ouvertes.fr:hal-00022742

From: Pierre Lopez <>

Submitted on: Thursday, 13 April 2006 13:36:47

Updated on: Thursday, 23 May 2013 15:44:19