A Scatter Search Method for Fuzzy Job Shop Scheduling Problem with Availability Constraints

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

World Congress on Engineering (WCE 2011), London, Kanada, 6 - 08 Temmuz 2011, ss.1144-1148 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: London
  • Basıldığı Ülke: Kanada
  • Sayfa Sayıları: ss.1144-1148
  • İstanbul Teknik Üniversitesi Adresli: Evet

Ö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 dynamically due to both human and machine resource factors. Fuzzy sets are used to model the uncertain processing times and due dates in recent years. In this study, a fuzzy job shop scheduling problem with availability constraints is considered. 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).