Heuristic to minimize makespan and the maximum delay in the problem of scheduling Job-Shop multi-resource with linear routes
Article Sidebar
Article Details
Authors keep the copyright and accept the publication of the contents under the license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International. When authors submit their manuscript, it is assumed that they know and accept the terms of open access and the license used, that they allow initial publication in this journal and the disclosure of the work
Downloads
Main Article Content
Abstract
This article has as its main objective the formulation and validation of a heuristic, based on the local search to minimize makespan (longer order completion time) and the maximum delay (maximum delay), for the problem of scheduling Job-shop multi- resource with linear routes. This problem exemplifies situations in industrial processes in which there is a set of machines to select a subset of them and develop each of the order operations, which are organized according to a Job-shop configuration. The validation was made considering cases of the literature and the results show that the heuristic finds new and better solutions for several instances, in rational execution times.
References
Dauzère-Pérès, S. (1998). Multi-resource shop scheduling with resource Flexibility. European Journal of Operational Research (107), 289-305.
García-León, A., Dauzère-Pérès, S., & Mati, Y. (2015). Minimizing regular criteria in the Flexible Job-shop scheduling problem. Multidisciplinary International scheduling Conference: Theory & Applications, 443-456.
Genova, K., & Guliashki, V. (2015). A survey of solving approaches for multiple objective flexible job shop scheduling problems. Cybernetics and Information Technologies, 15(2), 3-22.
Roy, B. Sussmann, B. (1964). Les problemes d’ordonnancement avec contraintes disjonctives. Revue Française d’informatique et the recherche opérationnelle. Série verte, 3, 51-65.
Singer, M. P. (1998). A computational study of branch and bound techniques for minimizing the total weighted tardiness in job-shops. IIE Transactions, 30(2), 109-118.