Job Shop Scheduling Problem: an Overview

Amr Arisha, Paul Young, Mohie El Baradie

Research output: Contribution to conferencePaperpeer-review

Abstract

The Job-shop scheduling is one of the most important industrial activities, especially in manufacturing planning. The problem complexity has increased along with the increase in the complexity of operations and product-mix. To solve this problem, numerous approaches have been developed incorporating discrete event simulation methodology. The scope and the purpose of this paper is to present a survey which covers most of the solving techniques of Job Shop Scheduling (JSS) problem. A classification of these techniques has been proposed: Traditional Techniques and Advanced Techniques. The traditional techniques to solve JSS could not fully satisfy the global competition and rapidly changing in customer requirements. Simulation and Artificial Intelligence (AI) have proven to be excellent strategic tool for scheduling problems in general and JSS in particular. The paper defined some AI techniques used by manufacturing systems. Finally, the future trends are proposed briefly.
Original languageEnglish
DOIs
Publication statusPublished - 2001
EventInternational Conference for Flexible Automation and Intelligent Manufacturing - Dublin, Ireland
Duration: 1 Jul 200131 Jul 2001

Conference

ConferenceInternational Conference for Flexible Automation and Intelligent Manufacturing
Country/TerritoryIreland
CityDublin
Period1/07/0131/07/01
OtherFAIM 01

Keywords

  • Job-shop scheduling
  • manufacturing planning
  • discrete event simulation
  • Traditional Techniques
  • Advanced Techniques
  • global competition
  • customer requirements
  • Simulation
  • Artificial Intelligence
  • AI
  • future trends

Fingerprint

Dive into the research topics of 'Job Shop Scheduling Problem: an Overview'. Together they form a unique fingerprint.

Cite this