Tardiness minimisation heuristic for job shop scheduling under uncertainties using group sequences Online publication date: Fri, 06-Apr-2018
by Zakaria Yahouni; Nasser Mebarki; Zaki Sari
International Journal of Intelligent Engineering Informatics (IJIEI), Vol. 6, No. 1/2, 2018
Abstract: In an industrial environment, manufacturing systems may be subject to considerable uncertainties which could lead to numerous schedule disturbances. These disturbances prevent the execution of a manufacturing schedule as it was planned. The 'groups of permutable operations' method copes with this drawback by proposing a family of schedules instead of a unique one. However, the selection of the appropriate schedule that accounts for real-time disturbances represents a combinatorial optimisation challenge. In this paper, we propose a new decision-aid criterion for selecting the schedule that fits best the real state of the shop. This criterion is measured using a greedy heuristic that anticipates the maximum tardiness in a job shop scheduling environment. Simulation tests performed on benchmark problems show the usefulness of the proposed criterion compared to another frequently used criterion. The final results emphasise the usefulness of this criterion in a bi-criteria decision-aid system.
Online publication date: Fri, 06-Apr-2018
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Engineering Informatics (IJIEI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com