A scatter search method for fuzzy job shop scheduling problem with availability constraints

Orhan Engin*, M. Kerim Yilmaz, Cengiz Kahraman, M. Emin Baysal, Ahmet Sarucan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

Abstract

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).

Original languageEnglish
Title of host publicationProceedings of the World Congress on Engineering 2011, WCE 2011
Pages1144-1148
Number of pages5
Publication statusPublished - 2011
EventWorld Congress on Engineering 2011, WCE 2011 - London, United Kingdom
Duration: 6 Jul 20118 Jul 2011

Publication series

NameProceedings of the World Congress on Engineering 2011, WCE 2011
Volume2

Conference

ConferenceWorld Congress on Engineering 2011, WCE 2011
Country/TerritoryUnited Kingdom
CityLondon
Period6/07/118/07/11

Keywords

  • Availability constraints
  • Fuzzy job shop scheduling problems
  • Hybrid genetic algorithm
  • Scatter search method

Fingerprint

Dive into the research topics of 'A scatter search method for fuzzy job shop scheduling problem with availability constraints'. Together they form a unique fingerprint.

Cite this