SavedAdd your journal

Journals / Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım ve Teknoloji / 2022 / Cilt: 10 - Sayı: 3

Parallel Machine Scheduling Problem with Unavailable Time Periods and Sequence Dependent Setup Times

Kullanılamayan Zaman Dilimlerinin ve Sıra Bağımlı Hazırlık Sürelerinin Olduğu Paralel Makina Çizelgeleme Problemi

Feriştah ÖZÇELİK
Tuğba SARAÇ
Pages
588–600
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)

By taking into account the unavailable time periods, an average of 5.29% reduction was achieved in the makespan.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In machine scheduling problems, not all machines are always available.
📊
Key Findings & Data:The performance of the proposed mathematical model is demonstrated using randomly generated test problems.
💡
Conclusion & Impact:By taking into account the unavailable time periods, an average of 5.29% reduction was achieved in the makespan.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:İlişkisiz paralel makine çizelgeleme problemi · kullanılamayan zaman dilimleri · sıra bağımlı hazırlık süreleri

Abstract

In machine scheduling problems, not all machines are always available. They may be interrupted periodically for reasons such as planned maintenance, lunch and rest breaks. However, this situation is often overlooked in the literature. In this study, unrelated parallel machine scheduling problem with unavailable time periods and sequence dependent setup times is discussed. A mathematical model has been developed for the considered problem. The performance of the proposed mathematical model is demonstrated using randomly generated test problems. By taking into account the unavailable time periods, an average of 5.29% reduction was achieved in the makespan.

Özet

Makine çizelgeleme problemlerinde tüm makineler daima kullanılabilir durumda değildirler. Planlı bakım, öğle yemeği ve dinlenme molaları gibi nedenlerle periyodik olarak kesintilere uğrayabilmektedirler. Ancak literatürde genellikle bu durum göz ardı edilmektedir. Bu çalışmada kullanılamayan zaman dilimlerinin ve sıra bağımlı hazırlık sürelerinin olduğu ilişkisiz paralel makine çizelgeleme problemi ele alınmıştır. Ele alınan problem için bir matematiksel model geliştirilmiştir. Önerilen matematiksel modelin performansı rassal türetilen test problemleri kullanılarak gösterilmiştir. Kullanılamayan zaman dilimlerinin dikkate alınmasıyla son için tamamlanma zamanlarında ortalama %5,29’luk bir azalma sağlanmıştır.

🔖

Cite This Article

ÖZÇELİK, F., SARAÇ, T. (2022). Parallel Machine Scheduling Problem with Unavailable Time Periods and Sequence Dependent Setup Times. Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım ve Teknoloji, Cilt: 10 - Sayı: 3, 588–600. https://ajindex.com/articles/521858

📄 Full Text PDF Viewer

📄

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

References (12)

  1. Low C., Ji M., Hsu C-J., Su C-T, Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance, Applied Mathematical Modelling, 34 (2010) 334–342
  2. Perez-Gonzalez P., Framinan J.M., Single machine scheduling with periodic machine availability, Computers & Industrial Engineering, 123 (2018) 180–188
  3. Ji M., Cheng TCE, Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan, Computers & Industrial Engineering, 59 (2010) 794–798
  4. Rapine C., Brauner N., Finke G., Lebacque V., Single machine scheduling with small operator-non-availability periods, Journal of Scheduling, 15 (2012) 127–139
  5. Shabtay D., Zofi, M., Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan, International Journal of Production Economics, 198 (2018) 191–200
  6. Shabtay D., Single-machine scheduling with machine unavailability periods and resource dependent processing times, European Journal of Operational Research, 296 (2022) 423–439
  7. Mor B., Mosheiov G., Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times, Computers & Industrial Engineering, 62 (2012) 908–916
  8. Kacem I., Chu C., Souissi A., Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times, Computers & Operations Research, 35 (2008) 827 – 844
  9. Khoudi A., Berrichi A., Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm, Operational Research, 20: (2020) 1763–1789
  10. Laalaoui Y., M’Hallah R., A binary multiple knapsack model for single machine scheduling with machine unavailability, Computers & Operations Research, 72 (2016) 71–82
  11. Low C., Li R-K, Wu G-H, Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval, Mathematical Problems in Engineering, (2016) Article ID 6124734 [12] Mashkani O., Moslehi G., Minimising the total completion time in a single machine scheduling problem under bimodal flexible periodic availability constraints, International Journal of Computer Integrated Manufacturing, 29:3 (2016) 323-341
  12. Mor B., Shapira D., Single machine scheduling with non-availability interval and optional job rejection, Journal of Combinatorial Optimization, (2022) In press [14]