Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12313/2227
Title: A Fast Pareto Approach to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times
Authors: García-León, Andrés A.
Torres Tapia, William F.
Keywords: Scheduling theory
Extension of the Job-Shop scheduling problem
Regular criteria
Maintenance activity
Sequence dependent
Set-up times
Local search
Pareto Optimization
Issue Date: 8-Oct-2020
Publisher: Communications in Computer and Information Science
Citation: García-León A.A., Torres Tapia W.F. (2020) A Fast Pareto Approach to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times. In: Figueroa-García J.C., Garay-Rairán F.S., Hernández-Pérez G.J., Díaz-Gutierrez Y. (eds) Applied Computer Sciences in Engineering. WEA 2020. Communications in Computer and Information Science, vol 1274. Springer, Cham. https://doi.org/10.1007/978-3-030-61834-6_16
Abstract: In the Job-shop scheduling problem minimizing the makespan has been the dominant approach in the literature. The level of the customer service cannot be measured efficiently for this criterion, since it does not consider relevant aspects like the due date of jobs to determine the tardiness. In this paper, we propose an innovate general approach for minimizing regular criteria in the Job-shop Scheduling which adds the conditions of maintenance activities and sequence dependent set-up times considering the Pareto optimization. Our approach makes use of the disjunctive graph model to represent schedules and support the search for an optimal solution using a classical estimation function at reversing a critical arc. The search is performed by two phases: improvement and diversification. In the improvement phase, initially, a random criterion is selected to create improving moves iteratively. When it is not possible to create a move using the selected criterion, it is penalized and a new criterion is selected. The diversification phase considers feasibility conditions to escape from a local optimal. In each move the set of solutions of the front is updated. The efficiency of our approach is illustrated on instances of literature at performing three sets of criteria. The first set considers makespan and maximum tardiness. In the second ∑Ci is considered and in the third the total tardiness. As a contribution of our approach, a benchmark of results is proposed by future research.
URI: https://link.springer.com/chapter/10.1007%2F978-3-030-61834-6_16
ISSN: 1865-0929
Appears in Collections:Artículos

Files in This Item:
There are no files associated with this item.



Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.