Robustness optimisation of the minimum makespan schedules in a job shop Online publication date: Sat, 19-Jul-2003
by Yuuki Kawata, Katsumi Morikawa, Katsuhiko Takahashi, Nobuto Nakamura
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 5, No. 1/2, 2003
Abstract: In general, many minimum makespan schedules exist in job shops. Therefore, it is important to select the best one based on secondary criterion. In this paper, we adopt a measure called robustness of the schedule as the selection criterion. The robustness of the schedule is the maximum value of the sensitivity, which is a measure for the delay of completion times by one time unit, for all of the operations. As there are generally many minimum makespan schedules, it is difficult to enumerate all makespan-minimum active schedules and then to find the most robust schedule. A branch and bound method is introduced to the minimisation of makespan while optimising robustness based on a disjunctive graph model and the propositions proposed by Carlier and Pinson. A lower bound of robustness for each partial schedule is calculated using the corresponding disjunctive graph. The effectiveness of the proposed approach is clarified by solving test problems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook