A note on the proportionate flow shop with a bottleneck machine
Choi, B.-C., Yoon, S.-H., Chung, S.-J., 2007. Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research 176, 964-974 consider the proportionate flow shop with a slow bottleneck machine and propose the SLDR heuristic for it. Choi et al. (2007) derive a data-dependent worst-case ratio bound for the SLDR heuristic which is then bounded by two. In this note, we show that the tight worst-case ratio bound of the SLDR heuristic is 3/2.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Choi, Byung-Cheon & Yoon, Suk-Hun & Chung, Sung-Jin, 2007. "Minimizing maximum completion time in a proportionate flow shop with one machine of different speed," European Journal of Operational Research, Elsevier, vol. 176(2), pages 964-974, January.
- M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1975. "Flowshop Sequencing Problem with Ordered Processing Time Matrices," Management Science, INFORMS, vol. 21(5), pages 544-549, January.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:193:y:2009:i:2:p:644-645. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.