A new lower bound for the two-machine total tardiness flow shop scheduling problem
We consider the classical two machine flow shop scheduling problem, with total tardiness criterion. This problem is strongly NP-hard and literature contains already some lower bounds and dominance conditions. The more recent lower bound of the literature is due to Pan Chen and Chao (COR 2002) and is...
Main Author: | |
---|---|
Other Authors: | , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2006
|
Subjects: | |
Online Access: | https://hal.science/hal-01048625 |
id |
ftunitours:oai:HAL:hal-01048625v1 |
---|---|
record_format |
openpolar |
spelling |
ftunitours:oai:HAL:hal-01048625v1 2024-09-15T18:13:42+00:00 A new lower bound for the two-machine total tardiness flow shop scheduling problem Billaut, Jean-Charles Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT) Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL) Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS) Reykjavic, Iceland 2006-07 https://hal.science/hal-01048625 en eng HAL CCSD hal-01048625 https://hal.science/hal-01048625 21st European Conference on Operational Research https://hal.science/hal-01048625 21st European Conference on Operational Research, Jul 2006, Reykjavic, Iceland. pp.136 [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC] info:eu-repo/semantics/conferenceObject Conference papers 2006 ftunitours 2024-07-08T23:39:45Z We consider the classical two machine flow shop scheduling problem, with total tardiness criterion. This problem is strongly NP-hard and literature contains already some lower bounds and dominance conditions. The more recent lower bound of the literature is due to Pan Chen and Chao (COR 2002) and is an improvement of the lower bound proposed by Pan and Fan (IJSE, 1997), Kim (COR 1993) and Sen Dileepan and Gupta (COR 1989). We propose here a new lower bound. Computational experiments show that this bound allows to obtain better results, both in terms of generated nodes and computation time. Conference Object Iceland Université François-Rabelais de Tours: HAL |
institution |
Open Polar |
collection |
Université François-Rabelais de Tours: HAL |
op_collection_id |
ftunitours |
language |
English |
topic |
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC] |
spellingShingle |
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC] Billaut, Jean-Charles A new lower bound for the two-machine total tardiness flow shop scheduling problem |
topic_facet |
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC] |
description |
We consider the classical two machine flow shop scheduling problem, with total tardiness criterion. This problem is strongly NP-hard and literature contains already some lower bounds and dominance conditions. The more recent lower bound of the literature is due to Pan Chen and Chao (COR 2002) and is an improvement of the lower bound proposed by Pan and Fan (IJSE, 1997), Kim (COR 1993) and Sen Dileepan and Gupta (COR 1989). We propose here a new lower bound. Computational experiments show that this bound allows to obtain better results, both in terms of generated nodes and computation time. |
author2 |
Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT) Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL) Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS) |
format |
Conference Object |
author |
Billaut, Jean-Charles |
author_facet |
Billaut, Jean-Charles |
author_sort |
Billaut, Jean-Charles |
title |
A new lower bound for the two-machine total tardiness flow shop scheduling problem |
title_short |
A new lower bound for the two-machine total tardiness flow shop scheduling problem |
title_full |
A new lower bound for the two-machine total tardiness flow shop scheduling problem |
title_fullStr |
A new lower bound for the two-machine total tardiness flow shop scheduling problem |
title_full_unstemmed |
A new lower bound for the two-machine total tardiness flow shop scheduling problem |
title_sort |
new lower bound for the two-machine total tardiness flow shop scheduling problem |
publisher |
HAL CCSD |
publishDate |
2006 |
url |
https://hal.science/hal-01048625 |
op_coverage |
Reykjavic, Iceland |
genre |
Iceland |
genre_facet |
Iceland |
op_source |
21st European Conference on Operational Research https://hal.science/hal-01048625 21st European Conference on Operational Research, Jul 2006, Reykjavic, Iceland. pp.136 |
op_relation |
hal-01048625 https://hal.science/hal-01048625 |
_version_ |
1810451454226333696 |