Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

Chaotic Behavior of a Single Machine Scheduling Problem with an Expected Mean Flow Time Measure

기대 평균흐름시간 최소화를 위한 단일설비 일정계획의 성능변동 분석

  • Joo, Un Gi (Department of Industrial and Management Engineering, Sun Moon University)
  • 주운기 (선문대학교 산업경영공학과)
  • Received : 2015.09.21
  • Accepted : 2015.12.09
  • Published : 2016.02.29
Download PDF
⟨ Previous Next ⟩

Abstract

A single machine scheduling problem for jobs with stochastic processing time is considered in this study. Shortest processing time (SPT) sequencing according to the expected processing times of jobs is optimal for schedules with minimal expected mean flow time when all the jobs arrive to be scheduled and their expected processing times are known. However, SPT sequencing according to the expected processing time may not be optimal for the minimization of the mean flow time when the actual processing times of jobs are known. This study evaluates the complexity of SPT sequencing through a comparison of the mean flow times of schedules based on the expected processing times and actual processing times of randomly generated jobs. Evaluation results show that SPT sequencing according to the expected flow time exhibits chaotic variation to the optimal mean flow time. The relative deviation from the optimal mean flow time increases as the number of jobs, processing time, or coefficient of variation increases.

Keywords

References

  1. Alfaro, M.D. and J.M. Sepulveda, "Chaotic Behavior in Manufacturing Systems," International Journal of Production Economics, Vol.101(2006), pp.150-158. https://doi.org/10.1016/j.ijpe.2005.05.012
  2. Chryssolouris, G., N. Giannelos, N., Papkkostas, and D. Mourtzis, "Chaos Theory in Production Scheduling," CIRP Annals-Manufacturing Technology, Vol.53(2004), pp.381-383. https://doi.org/10.1016/S0007-8506(07)60721-5
  3. Efthymiou, K., A. Pagoropoulos, N. Papakostas, D. Mourtzis, and G. Chryssolouris, "Manufacturing Systems Complexity Review : Challenges and Outlook," Procedia CIRP, Vol.3(2012), pp.644-649. https://doi.org/10.1016/j.procir.2012.07.110
  4. Efthymiou, K., A. Pagoropoulos, N. Papakostas, D. Mourtzis, and G. Chryssolouris, "Manufacturing Systems Complexity : an Assessment of manufacturing Performance Indicators Unpredictability," CIRP Journal of Manufacturing Science and Technology, Vol.3(2014), pp.324-334.
  5. Elmaraghy, W.H. and R.J. Urbanic, "Modelling of Manufacturing Systems Complexity," CIRP Annals-Manufacturing Technology, Vol.52(2003), pp.363-366. https://doi.org/10.1016/S0007-8506(07)60602-7
  6. Law, A.M. and W.D. Kelton, Simulation Modeling and Analysis, McGraw-Hill, Inc., 1982.
  7. Lawrence, S.R. and E.C. Sewell, "Heuristic, Optimal, Static, and Dynamic Schedules when Processing Times are Uncertain," Journal of Operations Management, Vol.15(1997), pp.71-82. https://doi.org/10.1016/S0272-6963(96)00090-3
  8. Papkkostas, N., K. Efthymiou, D. Mourtzis, and G. Chryssolouris, "Modeling the Complexity of Manufacturing Systems using Nonlinear Dynamics Approaches," CIRP Annals-Manufacturing Technology, Vol.58(2009), pp.437-440. https://doi.org/10.1016/j.cirp.2009.03.032
  9. Rinnooy, Kan, A.H.G., Machine Scheduling Problems : Classification, Complexity and Computations, Martinus Nijhoff, 1976.
  10. Rothkopf, M.H., "Scheduling with Random Service Times," Management Science, Vol.12(1966), pp.707-713. https://doi.org/10.1287/mnsc.12.9.707
  11. Wiley Online Library, Appendix A : Practical Processing Time Distributions, Principles of Sequencing and Scheduling, http://onlinelibrary.wiley.com/doi/10.1002/9780470451793.app1/pdf, accessed in 2015.
  12. Zhou, X. and X. Cai, "General Stochastic Single-machine Scheduling with Regular Cost Functions," Mathematical and Computer Modelling, Vol.26(1997), pp.95-108. https://doi.org/10.1016/S0895-7177(97)00134-9