A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
- Authors
- Jeong, In-Jae; Yim, Seung-Bin
- Issue Date
- Feb-2009
- Publisher
- TAYLOR & FRANCIS LTD
- Keywords
- job shop scheduling; cooperation; Lagrangian relaxation
- Citation
- INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.47, no.24, pp.6783 - 6805
- Indexed
- SCIE
SCOPUS
- Journal Title
- INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Volume
- 47
- Number
- 24
- Start Page
- 6783
- End Page
- 6805
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177264
- DOI
- 10.1080/00207540701824217
- ISSN
- 0020-7543
- Abstract
- This paper considers a distributed job shop scheduling problem where autonomous sub-production systems share common machines with each other. Each sub-production system is responsible for the scheduling of a set of jobs to minimise the total completion time on shared machines. A sub-production system has ultimate responsibility on maintaining private information such as objective function, processing time and routings on shared machines. Also sub-production systems must cooperate each other in order to achieve a global goal while sharing minimum of private information. In this research, we propose a distributed cooperation method in which sub-production systems and shared machines interact with one another to find a compromised solution between a locally optimised solution and a system-wide solution. We tested the proposed method for small, medium and large size of job shop scheduling problems and compared to a global optimal solutions. The proposed method shows promising results in terms of solution qualities and computational times.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.