A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability
IIE Annual Conference and Expo 2007 - Industrial Engineering's Critical Role in a Flat World - Conference Proceedings
962 - 967
Item Usage Stats
MetadataShow full item record
The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are subject to considerable uncertainty in dynamic environments. The ability to cope with the uncertainty in scheduling process is becoming increasingly important in today's highly dynamic and competitive business environments. In the literature, two approaches have appeared as the effective way: reactive and proactive scheduling. The objective in reactive scheduling is to revise schedules as necessary, while proactive scheduling attempts to incorporate future disruptions when generating schedules. In this paper we take a proactive scheduling approach to solve a machine scheduling problem with two sources of uncertainty: processing time variability and machine breakdowns. We define two robustness measures and develop a heuristic based on beam search methodology to optimize them. The computational results show that the proposed algorithms perform significantly better than a number of heuristics available in the literature.
Machine shop practice
Showing items related by title, author, creator and subject.
Zarifoglu, E.; Sabuncuoglu I. (2006)Businesses deal with huge databases over a geographically distributed supply network. When this is combined with scheduling and planning needs, it becomes too difficult to handle. Recently, Fast Consumer Goods sector tends ...
De, P.; Ghosh, J. B.; Wells, C. E. (Elsevier, 1996)In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We ...
Tansel, B. C.; Sabuncuoğlu, İ. (Palgrave Macmillan, 1997)Virtually all algorithmic studies on the single machine total tardiness problem use Emmons' theorems that establish precedence relations between job pairs. In this paper, we investigate these theorems with a geometric ...