Volume 55, 2021Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|Page(s)||S1165 - S1193|
|Published online||02 March 2021|
A supervised method for scheduling multi-objective job shop systems in the presence of market uncertainties
Department of Mechanical and Manufacturing Engineering, University of Putra Malaysia, Serdang, Sl43400, Malaysia.
2 Department of Management, The Social Science University of Ankara, Ankara, Turkey
3 Department of Management, Islamic Azad University, Tehran, Iran
4 Department of Industrial Engineering, Kharazmi University, Tehran, Iran
* Corresponding author: firstname.lastname@example.org
Accepted: 24 July 2020
In real industries, managers usually consider more than one objective in scheduling process. Minimizing completion time, operational costs and average of machine loads are amongst the main concerns of managers during production scheduling in practice. The purpose of this research is to develop a new scheduling method for job-shop systems in the presence of uncertain demands while optimizing completion time, operational costs and machine load average are taken into account simultaneously. In this research a new multi-objective nonlinear mixed integer programming method is developed for job-shop scheduling in the presence of product demand uncertainty. The objectives of the proposed method are minimizing cost, production time and average of machine loads index. To solve the model, a hybrid NSGA-II and Simulated Annealing algorithms is proposed where the core of the solving algorithm is set based on weighting method. In continue a Taguchi method is set for design of experiments and also estimate the best initial parameters for small, medium and large scale case studies. Then comprehensive computational experiments have been carried out to verify the effectiveness of the proposed solution approaches in terms of the quality of the solutions and the solving times. The outcomes are then compared with a classic Genetic Algorithm. The outcomes indicated that the proposed algorithm could successfully solve large-scale experiments less than 2 min (123 s) that is noticeable. While performance of the solving algorithm are taken into consideration, the proposed algorithm could improve the outcomes in a range between 9.07% and 64.96% depending on the input data. The results also showed that considering multi-objective simultaneously more reasonable results would be reached in practice. The results showed that the market demand uncertainty can significantly affect to the process of job shop scheduling and impose harms in manufacturing systems both in terms of completion time and machine load variation. Operational costs, however, did not reflect significantly to market demand changes. The algorithm is then applied for a manufacturing firm. The outcomes showed that the proposed algorithm is flexible enough to be used easily in real industries.
Mathematics Subject Classification: 93A30
Key words: Job-shop / NSGA-II / Simulate Annealing / multi-objective scheduling
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.