Research Article
BibTex RIS Cite

Solution Representation in Proportionate Multiprocessor Open Shop

Year 2021, Volume: 4 Issue: 2, 86 - 93, 23.09.2021
https://doi.org/10.38016/jista.852099

Abstract

Proportionate multiprocessor open shop is considered in this study. It is a shop model where a set of jobs follow no predefined route to visit several stages with at least one having two or more parallel machines to carry out the same task. Proportionality means that processing times depend only on stages and are independent of jobs, hence is defined as stage-wise. The shop model has various application areas in industry but the literature on the field is still limited. In this study, a novel solution representation scheme is proposed for the proportionate multiprocessor open shop. The scheme is based on permutation of stages and encodes the cumulative number of job assignments to a stage. The proposed scheme is shown to generate higher quality random solutions compared to the common operation permutation representation for the shop model. The approach proposed in this study to design a solution representation for a scheduling problem is a new and favorable approach that takes into account the specific machine environment, job characteristics and objective function of the problem under consideration. This way of designing solution representation schemes would increase the solution quality or decrease the computational time required in solution algorithms for scheduling problems.

References

  • Abdelmaguid, T. F. 2020. Scatter search with path relinking for multiprocessor open shop scheduling. Computers & Industrial Engineering, 141, 106292.
  • Abdelmaguid, T. F., Shalaby, M. A. & Awwad, M. A. 2014. A tabu search approach for proportionate multiprocessor open shop scheduling. Computational Optimization and Applications, 58, 187-203.
  • Adak, Z. 2020. An ant colony optimization approach for the proportionate multiprocessor open shop. PhD Doctoral thesis, Marmara University.
  • Adak, Z., Arıoğlu Akan, M. Ö. & Bulkan, S. 2020. Multiprocessor open shop problem: literature review and future directions. Journal of Combinatorial Optimization, 40, 547-569.
  • Azadeh, A., Hosseinabadi Farahani, M., Torabzadeh, S. & Baghersad, M. 2014. Scheduling prioritized patients in emergency department laboratories. Computer Methods and Programs in Biomedicine, 117, 61-70.
  • Bai, D., Zhang, Z.-H. & Zhang, Q. 2016. Flexible open shop scheduling problem to minimize makespan. Computers & Operations Research, 67, 207-215.
  • Chen, B., Potts, C. N. & Woeginger, G. J. 1998. A Review of Machine Scheduling: Complexity, Algorithms and Approximability. In: DU, D.-Z. & PARDALOS, P. M. (eds.) Handbook of Combinatorial Optimization: Volume1–3. Boston, MA: Springer US.
  • Goldansaz, S. M., Jolai, F. & Zahedi Anaraki, A. H. 2013. A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop. Applied Mathematical Modelling, 37, 9603-9616.
  • Gonzalez, T. & Sahni, S. 1976. Open Shop Scheduling to Minimize Finish Time. J. ACM, 23, 665–679.
  • Liaw, C.-F. 2000. A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operational Research, 124, 28-42.
  • Mao, W. Multi-operation multi-machine scheduling. HPCN-Europe 1995, 1995 Berlin, Heidelberg. Springer, Berlin, Heidelberg, 33-38.
  • Matta, M. E. 2009. A genetic algorithm for the proportionate multiprocessor open shop. Computers & Operations Research, 36, 2601-2618.
  • Naderi, B., Fatemi Ghomi, S. M. T., Aminnayeri, M. & Zandieh, M. 2011. Scheduling open shops with parallel machines to minimize total completion time. Journal of Computational and Applied Mathematics, 235, 1275-1287.
  • Ow, P. S. 1985. Focused Scheduling in Proportionate Flowshops. Management Science, 31, 852-869.
  • Pinedo, M. L. 2016. Scheduling: Theory, Algorithms, and Systems, Cham, Springer International Publishing.
  • Zhang, J., Wang, L. & Xing, L. 2019. Large-scale medical examination scheduling technology based on intelligent optimization. Journal of Combinatorial Optimization, 37, 385-404.

Orantılı Esnek Açık Atölye Tipinde Çözüm Gösterimi

Year 2021, Volume: 4 Issue: 2, 86 - 93, 23.09.2021
https://doi.org/10.38016/jista.852099

Abstract

Bu çalışmada orantılı esnek açık atölye tipi ele alınmıştır. Bu atölye modelinde yapılacak işlerin işlem istasyonlarını gezerken takip edecekleri bir rota bulunmaz ve bu istasyonların en az birinde aynı işlemi yapan iki veya daha fazla paralel makine bulunur. Orantılı ifadesi işlem sürelerinin istasyona bağlı olduğunu ve işten bağımsız olduğunu ifade eder. Böylece, orantılılık istasyon-bazlı olarak tanımlanmıştır. Bu atölye modelinin endüstride farklı uygulama alanları mevcuttur ancak bu alandaki literatür hala kısıtlıdır. Bu çalışmada, orantılı esnek açık atölye tipi için yeni bir çözüm gösterimi önerilmiştir. Önerilen gösterim istasyonların permutasyonuna dayanır ve bir istasyona yapılan kümülatif iş ataması sayısını şifreler. Önerilen bu yeni gösterim, bu atölye tipinde yaygın olarak kullanılan operasyon-permütasyonu gösteriminden daha iyi kalitede rastgele çözümler üretmiştir. Bu çalışmada çizelgeleme probleminde çözüm gösterimi tasarımında kullanılan yaklaşım yeni ve sonuçlar bakımından olumludur. Bu yaklaşım eldeki probleme özel makine ortamını, iş özelliklerini ve amaç fonksiyonunu dikkate alır. Çözüm gösterimi tasarlanmasında izlenen bu yol çizelgeleme problemlerinde kullanılan çözüm algoritmalarının daha yüksek kalitede çözüme ulaşmasını veya harcanan hesaplama zamanının kısaltılmasını sağlayacaktır.

References

  • Abdelmaguid, T. F. 2020. Scatter search with path relinking for multiprocessor open shop scheduling. Computers & Industrial Engineering, 141, 106292.
  • Abdelmaguid, T. F., Shalaby, M. A. & Awwad, M. A. 2014. A tabu search approach for proportionate multiprocessor open shop scheduling. Computational Optimization and Applications, 58, 187-203.
  • Adak, Z. 2020. An ant colony optimization approach for the proportionate multiprocessor open shop. PhD Doctoral thesis, Marmara University.
  • Adak, Z., Arıoğlu Akan, M. Ö. & Bulkan, S. 2020. Multiprocessor open shop problem: literature review and future directions. Journal of Combinatorial Optimization, 40, 547-569.
  • Azadeh, A., Hosseinabadi Farahani, M., Torabzadeh, S. & Baghersad, M. 2014. Scheduling prioritized patients in emergency department laboratories. Computer Methods and Programs in Biomedicine, 117, 61-70.
  • Bai, D., Zhang, Z.-H. & Zhang, Q. 2016. Flexible open shop scheduling problem to minimize makespan. Computers & Operations Research, 67, 207-215.
  • Chen, B., Potts, C. N. & Woeginger, G. J. 1998. A Review of Machine Scheduling: Complexity, Algorithms and Approximability. In: DU, D.-Z. & PARDALOS, P. M. (eds.) Handbook of Combinatorial Optimization: Volume1–3. Boston, MA: Springer US.
  • Goldansaz, S. M., Jolai, F. & Zahedi Anaraki, A. H. 2013. A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop. Applied Mathematical Modelling, 37, 9603-9616.
  • Gonzalez, T. & Sahni, S. 1976. Open Shop Scheduling to Minimize Finish Time. J. ACM, 23, 665–679.
  • Liaw, C.-F. 2000. A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operational Research, 124, 28-42.
  • Mao, W. Multi-operation multi-machine scheduling. HPCN-Europe 1995, 1995 Berlin, Heidelberg. Springer, Berlin, Heidelberg, 33-38.
  • Matta, M. E. 2009. A genetic algorithm for the proportionate multiprocessor open shop. Computers & Operations Research, 36, 2601-2618.
  • Naderi, B., Fatemi Ghomi, S. M. T., Aminnayeri, M. & Zandieh, M. 2011. Scheduling open shops with parallel machines to minimize total completion time. Journal of Computational and Applied Mathematics, 235, 1275-1287.
  • Ow, P. S. 1985. Focused Scheduling in Proportionate Flowshops. Management Science, 31, 852-869.
  • Pinedo, M. L. 2016. Scheduling: Theory, Algorithms, and Systems, Cham, Springer International Publishing.
  • Zhang, J., Wang, L. & Xing, L. 2019. Large-scale medical examination scheduling technology based on intelligent optimization. Journal of Combinatorial Optimization, 37, 385-404.
There are 16 citations in total.

Details

Primary Language English
Subjects Industrial Engineering
Journal Section Research Articles
Authors

Zeynep Adak 0000-0001-7654-0773

Publication Date September 23, 2021
Submission Date January 1, 2021
Published in Issue Year 2021 Volume: 4 Issue: 2

Cite

APA Adak, Z. (2021). Solution Representation in Proportionate Multiprocessor Open Shop. Journal of Intelligent Systems: Theory and Applications, 4(2), 86-93. https://doi.org/10.38016/jista.852099
AMA Adak Z. Solution Representation in Proportionate Multiprocessor Open Shop. JISTA. September 2021;4(2):86-93. doi:10.38016/jista.852099
Chicago Adak, Zeynep. “Solution Representation in Proportionate Multiprocessor Open Shop”. Journal of Intelligent Systems: Theory and Applications 4, no. 2 (September 2021): 86-93. https://doi.org/10.38016/jista.852099.
EndNote Adak Z (September 1, 2021) Solution Representation in Proportionate Multiprocessor Open Shop. Journal of Intelligent Systems: Theory and Applications 4 2 86–93.
IEEE Z. Adak, “Solution Representation in Proportionate Multiprocessor Open Shop”, JISTA, vol. 4, no. 2, pp. 86–93, 2021, doi: 10.38016/jista.852099.
ISNAD Adak, Zeynep. “Solution Representation in Proportionate Multiprocessor Open Shop”. Journal of Intelligent Systems: Theory and Applications 4/2 (September 2021), 86-93. https://doi.org/10.38016/jista.852099.
JAMA Adak Z. Solution Representation in Proportionate Multiprocessor Open Shop. JISTA. 2021;4:86–93.
MLA Adak, Zeynep. “Solution Representation in Proportionate Multiprocessor Open Shop”. Journal of Intelligent Systems: Theory and Applications, vol. 4, no. 2, 2021, pp. 86-93, doi:10.38016/jista.852099.
Vancouver Adak Z. Solution Representation in Proportionate Multiprocessor Open Shop. JISTA. 2021;4(2):86-93.

Journal of Intelligent Systems: Theory and Applications