Citation
Lagrangian Relaxation and Cut Generation for Sequence Dependent Setup Time Flowshop Scheduling Problems. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 655-659, 2009.
Paper
Abstract
Lagrangian relaxation technique is successfully applied to solve sequence dependent setup time flowshop problem to minimize the total weighted tardiness. The relaxed problem can be decomposed into each job-level subproblem that can be effectively solved by dynamic programming. Two types of the additional constraints for the violation of sequence dependent setup time constraints are imposed to the relaxed problem to strengthen the lower bound. The decomposed subproblem with the additional constraints is also effectively solved by the novel dynamic programming. Computational results show that the lower bound derived by the proposed method is extremely better than that of branch and bound algorithm.
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{2009-655-669-P, author = {T. Nishi and Y. Hiranaka},
title = {Lagrangian Relaxation and Cut Generation for Sequence Dependent Setup Time Flowshop Scheduling Problems},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {655--659},
note = {Paper},
abstract = {Lagrangian relaxation technique is successfully applied to solve sequence dependent setup time flowshop problem to minimize the total weighted tardiness. The relaxed problem can be decomposed into each job-level subproblem that can be effectively solved by dynamic programming. Two types of the additional constraints for the violation of sequence dependent setup time constraints are imposed to the relaxed problem to strengthen the lower bound. The decomposed subproblem with the additional constraints is also effectively solved by the novel dynamic programming. Computational results show that the lower bound derived by the proposed method is extremely better than that of branch and bound algorithm.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-655-669-P.pdf} }