The Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System

Publish Year: 1398
نوع سند: مقاله ژورنالی
زبان: English
View: 563

This Paper With 14 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_JOIE-12-2_007

تاریخ نمایه سازی: 21 خرداد 1398

Abstract:

Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs.  In this paper, just-in-time (JIT) flow shop scheduling problem with preemption and machine idle time assumptions is considered in which objective function is minimizing the sum of weighted earliness and tardiness. A new non-linear mathematical model is formulated for this problem and due to high complexity of the problem meta-heuristic approaches have been applied to solve the problem for finding optimal solution. The parameters of algorithms are set by Taguchi method. Each parameter is tested in three levels. By implementation of many problems with different sizes these levels are determined .The proposed model is solved by three meta-heuristic algorithms: genetic algorithm (GA), imperialist competitive algorithm (ICA) and hybrid of GA and ICA. To evaluate the performance of the proposed algorithms many test problems have been designed. The Computational results indicate the superiority of the performance of hybrid approach than GA and ICA in finding thebest solution in reasonable computational time.

Authors

Javad Rezaeian

Department of industrial engineering, Mazandaran University of Science and Technology, Babol, Iran

Sadegh Hosseini-Kia

Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran.

Iraj Mahdavi

Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach [مقاله ژورنالی]
  • Atashpaz-Gargari, E., & Lucas, C. (2007, 25-28 Sept. 2007). Imperialist ...
  • Baker, K. R., & Scudder, G. D. (1990). Sequencing with ...
  • Behnamian, J., & Fatemi Ghomi, S. M. T. (2014). Multi-objective ...
  • Chandra, P., Mehta, P., & Tirupati, D. (2009). Permutation flow ...
  • Ebadi, A., & Moslehi, G. (2012). Mathematical models for preemptive ...
  • Esteve, B., Aubijoux, C., Chartier, A., & T’kindt, V. (2006). ...
  • Finke, D. A., Medeiros, D. J., & Traband, M. T. ...
  • Fu, Q., Sivakumar, A. I., & Li, K. (2012). Optimisation ...
  • Gerstl, E., Mor, B., & Mosheiov, G. (2015). A note: ...
  • Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and ...
  • Hasanpour, j., ghodoosi, m., & hosseini, z. s. (2016). Optimizing ...
  • Hendel, Y., Runge, N., & Sourd, F. (2009). The one-machine ...
  • Hendel, Y., & Sourd, F. (2006). Efficient neighborhood search for ...
  • Holland, J. H. (1975). Adaptation in Natural and Artificial Systems: ...
  • Huynh Tuong, N., & Soukhal, A. (2010). Due dates assignment ...
  • Khorasanian, D., & Moslehi, G. (2017). Two-machine flow shop scheduling ...
  • Khorshidian, H., Javadian, N., Zandieh, M., Rezaeian, J., & Rahmani, ...
  • Koulamas, C. (1998a). On the complexity of two-machine flowshop problems ...
  • Koulamas, C. (1998b). A guaranteed accuracy shifting bottleneck algorithm for ...
  • Lann, A., & Mosheiov, G. (1996). Single machine scheduling to ...
  • Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, ...
  • Liao, C.-J., & Cheng, C.-C. (2007). A variable neighborhood search ...
  • Mehravaran, Y., & Logendran, R. (2012). Non-permutation flowshop scheduling in ...
  • A Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling [مقاله ژورنالی]
  • Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times [مقاله ژورنالی]
  • Rezaeian, J., Seidgar, H., & Kiani, M. (2013). Scheduling of ...
  • Runge, N., & Sourd, F. (2009). A new model for ...
  • Schaller, J. (2012). Scheduling a permutation flow shop with family ...
  • Schaller, J., & Valente, J. M. S. (2013). A comparison ...
  • Shabtay, D. (2012). The just-in-time scheduling problem in a flow-shop ...
  • Shabtay, D., Bensoussan, Y., & Kaspi, M. (2012). A bicriteria ...
  • Sourd, F. (2005). Punctuality and idleness in just-in-time scheduling. European ...
  • Sun, D.-h., Song, X.-x., Zhao, M., & Zheng, L.-J. (2012). ...
  • Tadayoni Rad, S., Gholami, S., Shafaei, R., & Seidgar, H. ...
  • Varmazyar, M., & Salmasi, N. (2012). Sequence-dependent flow shop scheduling ...
  • Ventura, J. A., & Radhakrishnan, S. (2003). Single machine scheduling ...
  • Zegordi, S. H., Itoh, K., & Enkawa, T. (1995). A ...
  • نمایش کامل مراجع