Machine-Oriented Decomposition of Flowshop Scheduling Problems Using Lagrangian Relaxation
In this paper, the Lagrangian decomposition and coordination technique is applied to flowshop scheduling problems in which the sum of the changeover cost and the tardiness penalty is minimized. The proposed method possesses a feature that the scheduling problem is decomposed not into single job-leve...
Saved in:
Published in | Shisutemu Seigyo Jouhou Gakkai rombunshi Vol. 14; no. 5; pp. 244 - 251 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | Japanese |
Published |
THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)
2001
|
Subjects | |
Online Access | Get full text |
ISSN | 1342-5668 2185-811X |
DOI | 10.5687/iscie.14.244 |
Cover
Abstract | In this paper, the Lagrangian decomposition and coordination technique is applied to flowshop scheduling problems in which the sum of the changeover cost and the tardiness penalty is minimized. The proposed method possesses a feature that the scheduling problem is decomposed not into single job-level subproblems but into single machine-level subproblems. By decomposing the problem into one-machine multi-operation subproblems, the changeover cost and/or changeover time can easily be embedded in the objective function. In the proposed method, each subproblem for a single machine is solved by combining the simulated annealing method and the neighborhood search algorithm. In order to avoid oscillations in multiplier values, a new Lagrangian function is used to solve each subproblem. The effectiveness of the proposed method is verified by comparing the results of the example problems solved by the proposed method with those solved by the simulated annealing method in which a schedule of the entire machine is successively improved. |
---|---|
AbstractList | In this paper, the Lagrangian decomposition and coordination technique is applied to flowshop scheduling problems in which the sum of the changeover cost and the tardiness penalty is minimized. The proposed method possesses a feature that the scheduling problem is decomposed not into single job-level subproblems but into single machine-level subproblems. By decomposing the problem into one-machine multi-operation subproblems, the changeover cost and/or changeover time can easily be embedded in the objective function. In the proposed method, each subproblem for a single machine is solved by combining the simulated annealing method and the neighborhood search algorithm. In order to avoid oscillations in multiplier values, a new Lagrangian function is used to solve each subproblem. The effectiveness of the proposed method is verified by comparing the results of the example problems solved by the proposed method with those solved by the simulated annealing method in which a schedule of the entire machine is successively improved. |
Author | HASEBE, Shinji HASHIMOTO, Iori NISHI, Tatsushi |
Author_xml | – sequence: 1 fullname: NISHI, Tatsushi organization: Graduate School of Engineering, Kyoto University – sequence: 1 fullname: HASHIMOTO, Iori organization: Graduate School of Engineering, Kyoto University – sequence: 1 fullname: HASEBE, Shinji organization: Graduate School of Engineering, Kyoto University |
BookMark | eNp1kM9Kw0AQhxepYK29-QB5AFMzm938OUptVahU1IJ4CbObTbqS7pbdiPr2Jo14ELzMMMz3DcPvlIyMNYqQc4hmPMnSS-2lVjNgM8rYERlTyHiYAbyMyBhiRkOeJNkJmXqvRRRDygBiPiav9yi32qhw7bQyrSqDayXtbm-9brU1ga2CZWM__Nbugye5VeV7o00dPDgrGrXzwcb34wprh6bWaIJH1eAn9u4ZOa6w8Wr60ydks1w8z2_D1frmbn61CiWNUxbmEqoqj2KW5UkuMC55JbkACkLKJBIZJDwVPKUUkrJiSYqKRQIjiiA6g2M8IXS4K5313qmqkLo9fNA61E0BUdEHVBwCKoAVXUCddPFH2ju9Q_f1H74Y8DffYq1-YXStlo0aYMizrBf4UDrvdy-36Apl4m9xIYS_ |
CitedBy_id | crossref_primary_10_1002_eej_10364 crossref_primary_10_1299_jsmec_48_299 crossref_primary_10_1541_ieejeiss_123_1327 |
ContentType | Journal Article |
Copyright | The Institute of Systems, Control and Information Engineers |
Copyright_xml | – notice: The Institute of Systems, Control and Information Engineers |
DBID | AAYXX CITATION |
DOI | 10.5687/iscie.14.244 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 2185-811X |
EndPage | 251 |
ExternalDocumentID | 10_5687_iscie_14_244 article_iscie1988_14_5_14_5_244_article_char_en |
GroupedDBID | ALMA_UNASSIGNED_HOLDINGS JSF KQ8 OK1 RJT AAYXX CITATION |
ID | FETCH-LOGICAL-c2374-9c1ff90348969ba3d5fc5b121bcc60b81657b572216df467ae40ba02a1b8965a3 |
ISSN | 1342-5668 |
IngestDate | Tue Jul 01 04:11:08 EDT 2025 Thu Apr 24 23:03:20 EDT 2025 Wed Sep 03 06:29:16 EDT 2025 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | true |
Issue | 5 |
Language | Japanese |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c2374-9c1ff90348969ba3d5fc5b121bcc60b81657b572216df467ae40ba02a1b8965a3 |
OpenAccessLink | https://www.jstage.jst.go.jp/article/iscie1988/14/5/14_5_244/_article/-char/en |
PageCount | 8 |
ParticipantIDs | crossref_citationtrail_10_5687_iscie_14_244 crossref_primary_10_5687_iscie_14_244 jstage_primary_article_iscie1988_14_5_14_5_244_article_char_en |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2001 |
PublicationDateYYYYMMDD | 2001-01-01 |
PublicationDate_xml | – year: 2001 text: 2001 |
PublicationDecade | 2000 |
PublicationTitle | Shisutemu Seigyo Jouhou Gakkai rombunshi |
PublicationTitleAlternate | Transactions of the Institute of Systems, Control and Information Engineers |
PublicationYear | 2001 |
Publisher | THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE) |
Publisher_xml | – name: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE) |
References | [3] H. Chen, C. Chu and J. M. Proth : A more efficient Lagrangian relaxation approach to job-shop scheduling problems; Proceedings of the IEEE International Conference on Robotics and Automation, pp. 496-501 (1995) [6] 玉置, 杉本, 荒木 : 非正規目的関数のもとでの並列機械スケジューリング問題の定式化と解法;生産スケジューリング・シンポジウム'96講演論文集, PP.67-72 (1996) [1] 米田 : ラグランジュ緩和法によるスケジューリング;システム/制御/情報, Vo1.41, No.4, pp.130-138 (1997) [5] F. D. Croce, G. Menga, R. Tadei, M. Cavalotto and L. Petri : Cellular control of manufacturing systems; European Journal of Operational Research, Vol. 69, pp. 498-509 (1996) [2] D. J. Hoitomt, P. B. Luh and K. R. Pattipati : A practical approach to job-shop scheduling problems; IEEE Transactions on Robotics and Automation, Vol. 9, No. 1, pp. 1-13 (1993) [4] M. Jinyan, S. Y. Chai and W. Youyi : FMS jobshop scheduling using Lagrangian relaxation; Proceedings of the IEEE International Conference on Robotics and Automation, pp. 490-495 (1995) [7] M. L. Fisher : The Lagrangian relaxation method for solving integer programming problems; Management Science, Vol. 27, No. 1, pp. 1-18 (1981) |
References_xml | – reference: [7] M. L. Fisher : The Lagrangian relaxation method for solving integer programming problems; Management Science, Vol. 27, No. 1, pp. 1-18 (1981) – reference: [3] H. Chen, C. Chu and J. M. Proth : A more efficient Lagrangian relaxation approach to job-shop scheduling problems; Proceedings of the IEEE International Conference on Robotics and Automation, pp. 496-501 (1995) – reference: [6] 玉置, 杉本, 荒木 : 非正規目的関数のもとでの並列機械スケジューリング問題の定式化と解法;生産スケジューリング・シンポジウム'96講演論文集, PP.67-72 (1996) – reference: [1] 米田 : ラグランジュ緩和法によるスケジューリング;システム/制御/情報, Vo1.41, No.4, pp.130-138 (1997) – reference: [2] D. J. Hoitomt, P. B. Luh and K. R. Pattipati : A practical approach to job-shop scheduling problems; IEEE Transactions on Robotics and Automation, Vol. 9, No. 1, pp. 1-13 (1993) – reference: [5] F. D. Croce, G. Menga, R. Tadei, M. Cavalotto and L. Petri : Cellular control of manufacturing systems; European Journal of Operational Research, Vol. 69, pp. 498-509 (1996) – reference: [4] M. Jinyan, S. Y. Chai and W. Youyi : FMS jobshop scheduling using Lagrangian relaxation; Proceedings of the IEEE International Conference on Robotics and Automation, pp. 490-495 (1995) |
SSID | ssib031741135 ssib006582340 ssj0000602769 |
Score | 1.4632168 |
Snippet | In this paper, the Lagrangian decomposition and coordination technique is applied to flowshop scheduling problems in which the sum of the changeover cost and... |
SourceID | crossref jstage |
SourceType | Enrichment Source Index Database Publisher |
StartPage | 244 |
SubjectTerms | changeover cost decentralized scheduling flowshop scheduling Lagrangian relaxation simulated annealing |
Title | Machine-Oriented Decomposition of Flowshop Scheduling Problems Using Lagrangian Relaxation |
URI | https://www.jstage.jst.go.jp/article/iscie1988/14/5/14_5_244/_article/-char/en |
Volume | 14 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
ispartofPNX | Transactions of the Institute of Systems, Control and Information Engineers, 2001/05/15, Vol.14(5), pp.244-251 |
journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 2185-811X dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000602769 issn: 1342-5668 databaseCode: KQ8 dateStart: 19880101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwELfK4AEeJj7F-FIe4KlKiR07Hy-TBqwUxChonTTxUtmp3WbrmqlNNOCv52yniVsNaSBVUeXcJW3u17vz9T4Qeq2ITEEjRj5jPPEpDYUvMsAyjZXgMpCcKZNt8TUanNDPp-y007lyq0tK0ct-X1tX8j9ShTWQq66S_QfJNheFBXgP8oUjSBiON5LxkcmElP5QNyvWruMHqVPE6zws7Qf258XValZc6m6bYFRM7fk3O0Nm1bXpAl_4FOzVNDex_Dn_2Yqq9lmPZ_mqKuVFBYoln_4qdNxwVlTdj_z8nOfdZXEhKp301cSVdQzM4ICXq8o5MTg4Pnxnsi_hkoszd33w6Wg4GhqFVSzzjVAEdvRmSGFPG9kJOT1p1sB5YH6CzUScVtlSB1TM1Zy2DWRthIntQrut31mkIyR9Xa8sQcf3Gia3jfaWeWuSDmG7o_nHhhu2PGPgvoVukxhcFP1v_ndHEbGEhG0THPCxKMa1X2lNPOzmzbjE5ovbogp9g7fux9twd-6cgce_zhY0DszoPtqtdx7egYXRA9SRi4fontOP8hH6sQ0obwNQXqG8NaC8FlDeGlCeAZTXAsprAfUYnfQPR-8Hfj18w89IGFM_zbBSaRDSJI1SwcMJUxkTmGCRZVEgEhyxWLCYEBxNFFhbLmkgeEA4FsDBePgE7SyKhXyKPMoDLCapSBOiKBWEZxOZilgAKVXgYO-h7voZjbO6M70ekDIfXyeyPfSmob60HVn-QrdvH3dDVf9OLRVOk0RTMnsAhua8rncE9fLshjd6ju7axET9eoF2ymUlX4KnWopXBlV_AAX0lnc |
linkProvider | Colorado Alliance of Research Libraries |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Machine-Oriented+Decomposition+of+Flowshop+Scheduling+Problems+Using+Lagrangian+Relaxation&rft.jtitle=Shisutemu+Seigyo+Jouhou+Gakkai+rombunshi&rft.au=NISHI%2C+Tatsushi&rft.au=HASEBE%2C+Shinji&rft.au=HASHIMOTO%2C+Iori&rft.date=2001&rft.issn=1342-5668&rft.eissn=2185-811X&rft.volume=14&rft.issue=5&rft.spage=244&rft.epage=251&rft_id=info:doi/10.5687%2Fiscie.14.244&rft.externalDBID=n%2Fa&rft.externalDocID=10_5687_iscie_14_244 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1342-5668&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1342-5668&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1342-5668&client=summon |