Citation
The Two-Stage Assembly Flow Shop Scheduling with an Availability Constraint. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 184-191, 2007.
Paper
Abstract
In this paper, we deal with the two-stage assembly flow shop scheduling problem with an availability constraint. The objective is to minimize the maximum completion time of the jobs (i.e. makespan). We are interested in the nonresumable model. We provide two heuristics with tight worst-case ratio bound of 2 when the availability constraint is imposed on one of the first stage’s machines. For the case where the gap is imposed on the assembly machine we show that no polynomial heuristic algorithm with finite error bound can be found.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-184-191-P, author = {H. Hadda and N. Dridi and S. Hajri-Gabouj},
title = {The Two-Stage Assembly Flow Shop Scheduling with an Availability Constraint},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {184--191},
note = {Paper},
abstract = {In this paper, we deal with the two-stage assembly flow shop scheduling problem with an availability constraint. The objective is to minimize the maximum completion time of the jobs (i.e. makespan). We are interested in the nonresumable model. We provide two heuristics with tight worst-case ratio bound of 2 when the availability constraint is imposed on one of the first stage’s machines. For the case where the gap is imposed on the assembly machine we show that no polynomial heuristic algorithm with finite error bound can be found.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-184-191-P.pdf} }