A two-stage hybrid flowshop scheduling problem in machine breakdown condition
- 641 Downloads
This paper considers a two-stage hybrid flowshop scheduling problem in machine breakdown condition. By machine breakdown condition we mean that the machine may not always be available during the scheduling period. Machine failure may occur with a known probability after completing a job. Probability of machine failure depends on the previous processed job. The problem to be studied has one machine at the first stage and M parallel identical machines at the second stage. The objective is to find the optimal job combinations and the optimal job schedule such that the makespan is minimized. The proposed problem is compatible with a large scope of real world situations. To solve the problem, first, we introduce one optimal approach for job precedence when there is one machine in both stages and then provide a heuristic algorithm when there are M machines in stage two. To examine the performance of the heuristic, some experiments used are provided as well.
KeywordsHybrid flowshop scheduling Breakdown Heuristic algorithm
Unable to display preview. Download preview PDF.
- Cai, X., Wu, X., & Zhou, X. (in press). Scheduling deteriorating jobs on a single machine subject to breakdowns. Journal of Scheduling. doi: 10.1007/s10951-009-0132-x.
- Gupta J. N. D. (1988) Two stage, hybrid flowshop scheduling problem. Journal of the Operational Research Society 39: 359–364Google Scholar
- Mirsanei, H. S., Zandieh, M., Moayed, M. J., & Khabbazi, M. R. (in press). A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-009-0373-8.
- Ríos-Mercado R. Z., Bard J. F. (1999a) A branch-and-bound algorithm for permutation flowshops with sequence-dependent setup times. IIE Transactions 31: 721–731Google Scholar
- Santos D. L., Hunsucker J. L., Deal D. E. (1995) Flowmult: Permutation sequences for flow shops with multiple processors. Journal of Information and Optimization Sciences 16: 351–366Google Scholar
- Tseng, C. T., Liao C. J., & Liao T. X. (in press). A note on two-stage hybrid flowshop scheduling with missing operations. Computers & Industrial Engineering. doi: 10.1016/j.cie.2007.09.005.
- Zandieh, M., Mozaffari, E., & Gholami, M. (in press). A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-009-0250-5.