Solving Fuzzy Job Shop Scheduling Problems with Availability Constraints Using a Scatter Search Method


ENGİN O., Yilmaz M. K. , BAYSAL M. E. , SARUCAN A.

JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, cilt.21, ss.317-334, 2013 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 21
  • Basım Tarihi: 2013
  • Dergi Adı: JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING
  • Sayfa Sayıları: ss.317-334

Özet

In the last decade job shop scheduling problems have been subject to intensive research due to their multiple applications. Job shop scheduling is known as a strongly NP-complete problem. In the job shop scheduling problems, processing times and due dates are very dynamic due to both human and machine resource factors. Fuzzy sets have been used to model the uncertain processing times and due dates in recent years. In this study, a fuzzy job shop s cheduling problem with availability constraints is considered. Availability constraints mean that machines can be unavailable for preventive maintenance, periodic repair or random breakdown. These constraints have been considered in this study for fuzzy job shop scheduling problems. A Scatter Search (SS) method is proposed to solve these problems. The feasibility and effectiveness of the proposed scatter search method is demonstrated by comparing it with the hybrid genetic algorithm (HGA). The aim of the study is to minimize the tardiness and earliness.