SavedAdd your journal

Journals / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi / 2003 / Cilt: 18 - Sayı: 3

A heuristic approach for the secondary criterion scheduling problem on a single machine

İki ölçütlü tek makinalı çizelgeleme problemi için sezgisel bir yaklaşım

Ertan GÜNER
Fulya ALTIPARMAK
Pages
27–42
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The effectiveness of the developed algorithm was evaluated on randomly generated problems by using various neighborhood search strategies.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, the secondary criteria problem that is minimizing the maximum earliness subject to minimum number of tardy jobs has been considered.
📊
Key Findings & Data:The solution time of the branch and bound algorithm which was developed for this problem increases exponentially based on problem size.
💡
Conclusion & Impact:The effectiveness of the developed algorithm was evaluated on randomly generated problems by using various neighborhood search strategies.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this study, the secondary criteria problem that is minimizing the maximum earliness subject to minimum number of tardy jobs has been considered. The solution time of the branch and bound algorithm which was developed for this problem increases exponentially based on problem size. Recently, some techniques such as simulated annealing, tabu search, genetic algorithms, and neural networks have been used often in finding global solution. In this study, an algorithm was developed based on simulated annealing for this problem. The effectiveness of the developed algorithm was evaluated on randomly generated problems by using various neighborhood search strategies.

Özet

Bu çalışmada, en küçük geciken iş kısıtı altında en büyük erken tamamlanma zamanının en küçüklendiği ikincil ölçütlü bir problem dikkate alınmıştır. Bu problem için geliştirilmiş olan dal-sınır algoritmasında çözüm zamanı, problem büyüklüğüne bağlı olarak üstel artış göstermektedir. Son yıllarda, çizelgeleme problemlerin çözümünde global en iyi çözümü bulmada başarılı olan genetik algoritmalar, tavlama benzetimi, tabu arama ve sinir ağları gibi yeni tekniklerin sıkça kullanıldığı görülmektedir. Bu çalışmada, bu problem için tavlama benzetimi tekniğine dayalı bir algoritma geliştirilmiştir. Geliştirilen algoritmanın performansında çeşitli komşu üretim mekanizmalarının etkileri rassal üretilen test problemleri üzerinde incelenmiştir.

🔖

Cite This Article

GÜNER, E., ALTIPARMAK, F. (2022). A heuristic approach for the secondary criterion scheduling problem on a single machine. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt: 18 - Sayı: 3, 27–42. https://ajindex.com/articles/524267

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. Smith, W.E., “Various optimizers for single stage production”, Naval Research Logistic Quarterly, 3, 59-66, (1956)
  2. Heck, H., Roberts, R., “A note on the extension of a result on scheduling with secondary criteria”, Naval Research Logistic Quarterly, 19, 403-405, (1972)
  3. Burns, R. N., “Scheduling to minimize the weighted completion times with secondary criteria”, Naval Research Logistic Quarterly, 23, 125-129, (1976)
  4. Miyazaki, S., “One machine scheduling problem with dual criteria”, Journal of Operations Research Society of Japan, 24 (1), 37-51, (1981)
  5. Bansal, S. P., “Single machine scheduling to minimize the weighted sum of completion times with secondary criterion, a branch and bound approach”, European Journal of Operations Research, 5, 177-181, (1980)
  6. Shanthikumar, J. G., Buzacott, J. A., “On the use of decomposition approaches in a single machine scheduling problem”, Journal of Operations Research Society of Japan, 25, 29-47, (1982)
  7. Posner, M. E., “Minimizing weighted completion times with deadlines”, Operations Research, 33, 562-574, (1985)
  8. Bagchi, U., Ahmadi, R. H., “An improved lower bound for minimizing weighted completion times with deadlines”, Operations Research, 35, 311- 313, (1987)
  9. Chand, S., Schneeberger, H., “A note on the single machine scheduling problem with minimum weighted completion time and maximum allowable tardiness”, Naval Research Logistic Quarterly, 33 551-557, (1986)
  10. Shanthikumar, J. G., “Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number tardy”, Computers & Operations Research, 10, 255-266, (1983)
  11. Gupta, J. N. D., and Ramnarayanan, “Single facility with dual criteria: minimizing maximum tardiness subject to minimum number of tardy jobs”, Production Planning & Control, 7, 2, 190-196, (1996)
  12. Gupta, J.N.D., Hariri, A.M.A and Potts, R., “Single-machine scheduling to minimize Maksimum Tradiness with Minimum Number of Tardy Jobs”, Annals of Operations Research, 92, 107-123, (1999)
  13. Emmons, H., “One machine sequencing to minimize mean flow time with minimum number tardy”, Naval Research Logistic Quarterly, 22, 585-592, (1975)
  14. Chand, S., Schneeberger, H., “Single machine scheduling to minimize weighted earliness subject to no tardy jobs”, European Journal of Operations Research, 34, 221-230, (1988)
  15. Güner, E., Erol S., Tani K., “One machine scheduling to minimize the maximum earliness with minimum number tardy jobs”, International Journal