Document Type
Conference Paper
Rights
Available under a Creative Commons Attribution Non-Commercial Share Alike 4.0 International Licence
Disciplines
2. ENGINEERING AND TECHNOLOGY
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.
DOI
https://doi.org/10.21427/D7WN5Q
Recommended Citation
Arisha, A., Young, P., El Baradie, M.:Job Shop Scheduling Problem: an Overview. International Conference for Flexible Automation and Intelligent Manufacturing (FAIM 01),Dublin, Ireland, July 2001, pp 682 – 693.
Funder
Intel - Ireland
Publication Details
International Conference for Flexible Automation and Intelligent Manufacturing (FAIM 01),Dublin, Ireland, July 2001, pp 682 – 693.