Robustness optimisation of the minimum makespan schedules in a job shop

Yuuki Kawata, Katsumi Morikawa, Katsuhiko Takahashi, Nobuto Nakamura

International Journal of Manufacturing Technology and Management, 2003, vol. 5, issue 1/2, 1-9

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.

Keywords: scheduling; job shop; makespan; optimisation; robustness. (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=2524 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmtma:v:5:y:2003:i:1/2:p:1-9

Access Statistics for this article

More articles in International Journal of Manufacturing Technology and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().