Four-machine flowshop scheduling problem with uncertain processing times to minimize mean completion time
List of Authors
  • Ali Allahverdi , Muberra Allahverdi

Keyword
  • Scheduling, flowshop, uncertain processing times, mean completion time

Abstract
  • The literature review of scheduling in manufacturing environments reveal that job processing times are mainly modelled as known fixed values. This might be true for some manufacturing environments, however, it is not true for some other manufacturing environments. Hence, job processing times have to modelled as uncertain variables. We consider flowshop scheduling problem with the objective function of minimizing mean completion time in this paper where processing times are modelled as uncertain random variables. Given that the problem is NP-hard, five heuristics are proposed and their performances are compared based on randomly generated data. Computational experiments reveal that one of the heuristics performs very well, and hence, it is recommended.

Reference
  • 1. Allahverdi, A., Aydilek, H. (2010a). Heuristics for two-machine flowshop scheduling problem to minimize makespan with bounded processing times. International Journal of Production Research, 48, 6367- 6385.

    2. Allahverdi, A., Aydilek, H. (2010b). Heuristics for two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times. Computers and Mathematics with Applications, 60, 1374-1384.

    3. Allahverdi, A., and Sotskov, Y.N. (2003). Two-machine flowshop minimum length scheduling problem with random and bounded processing times, International Transactions in Operational Research, 10, 65-76.

    4. Chen, J.F. (2015). Unrelated parallel-machine scheduling to minimize total weighted completion time. Journal of Intelligent Manufacturing, 26, 1099-1112.

    5. Kouvelis, P., Yu, G. (1997). Robust Discrete Optimization and its Applications. Kluwer Academic Publisher.

    6. Lai, T.C., and Sotskov, Y.N. (1999). Sequencing with uncertain numerical data for makespan minimization”, Journal of the Operational Research Society, 50, 230-243.

    7. Lai, T.C., Sotskov, Y.N., Sotskova, N.Y., Werner, F. (1997). Optimal makespan scheduling with given bounds of processing times. Mathematical and Computer Modelling, 26, 67-86.

    8. Sotskov, Y.N., Allahverdi, A., Lai, T.C. (2004). Flowshop scheduling problem to minimize total completion time with random and bounded processing times. Journal of Operational Research Society, 55, 277-286.

    9. Tayanithi, P., Manivannan, S., Banks, J. (1992). A knowledge-based simulation architecture to analyze interruptions in a flexible manufacturing system. Journal of Manufacturing Systems, 11, 195-214.