Title: Tardiness minimisation heuristic for job shop scheduling under uncertainties using group sequences

Authors: Zakaria Yahouni; Nasser Mebarki; Zaki Sari

Addresses: LS2N Laboratory, UMR 6004, Ecole centrale de Nantes, France; MELT Laboratory, University of Tlemcen, Algeria ' LS2N Laboratory, UMR 6004, LUNAM University of Nantes, France ' Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Algeria

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.

Keywords: scheduling; decision-aid system; job shop; maximum tardiness; optimisation.

DOI: 10.1504/IJIEI.2018.090995

International Journal of Intelligent Engineering Informatics, 2018 Vol.6 No.1/2, pp.4 - 22

Received: 03 Dec 2016
Accepted: 16 Feb 2017
Published online: 06 Apr 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article