Abstract
The Job-shop Scheduling problem Multi-resource Resource flexibility with linear routes is an extension of the classical Job-shop Scheduling problem “JSMRFLR” where an operation needs several resources (machines) simultaneously to be processed and each machine is selected from a given set. Linear route indicates that an operation is exclusively performed for a job. Publications related to this problem are really scarce and they are dedicated to minimize makespan criterion, which aims to minimize the use of the machines. In the modern scenery of the Operations Management, the exclusive minimization of the makespan does not allow to analyze aspects of the customer service to ensure high levels of competitiveness such as the consideration of due-date and the importance between jobs. In this paper, we propose a general Pareto approach to solve the JSMRFLR with regular criteria, which operates by an efficient local search at using a fast estimation function for the criteria considering the conjunctive graph. During the search, the set of non-dominated solutions 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 total flow time is added and in the third the total tardiness. As a product of our approach, a reference of results is proposed by future research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Dauzère-Pérès, S., Roux, W., Lasserre, J.: Multi-resource shop scheduling with resource flexibility. Eur. J. Oper. Res. 107(2), 289–305 (1998)
Mati, Y., Dauzère-Pérès, S., Lahlou, C.: A general approach for optimizing regular criteria in the job-shop scheduling problem. Eur. J. Oper. Res. 212(1), 33–42 (2011)
García-León, A., Dauzère-Pérès, S., Mati, Y.: Minimizing regular criteria in the flexible job-shop scheduling problem. In: 7th Multidisciplinary International Scheduling Conference: Theory and Applications, pp. 443–456 (2015)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7, 117–132 (2003)
García-León, A., Dauzère-Pérès, S., Mati, Y.: An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 108, 187–200 (2019)
Dauzère-Pérès, S., Paulli, J.: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann. Oper. Res. 70, 281–306 (1997)
Singer, M., Pinedo, M.: A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans. 30(2), 109–118 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
García-León, A.A., Torres Tapia, W.F. (2019). A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes. In: Figueroa-García, J., Duarte-González, M., Jaramillo-Isaza, S., Orjuela-Cañon, A., Díaz-Gutierrez, Y. (eds) Applied Computer Sciences in Engineering. WEA 2019. Communications in Computer and Information Science, vol 1052. Springer, Cham. https://doi.org/10.1007/978-3-030-31019-6_64
Download citation
DOI: https://doi.org/10.1007/978-3-030-31019-6_64
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31018-9
Online ISBN: 978-3-030-31019-6
eBook Packages: Computer ScienceComputer Science (R0)