A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes

Andrés Alberto García-León, William Fernando Torres Tapia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationApplied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings
EditorsJuan Carlos Figueroa-García, Mario Duarte-González, Sebastián Jaramillo-Isaza, Alvaro David Orjuela-Cañon, Yesid Díaz-Gutierrez
PublisherSpringer Healthcare
Pages764-775
Number of pages12
ISBN (Print)9783030310189
DOIs
StatePublished - 1 Jan 2019
Event6th Workshop on Engineering Applications, WEA 2019 - Santa Marta, Colombia
Duration: 16 Oct 201918 Oct 2019

Publication series

NameCommunications in Computer and Information Science
Volume1052
ISSN (Print)1865-0929
ISSN (Electronic)1865-0937

Conference

Conference6th Workshop on Engineering Applications, WEA 2019
CountryColombia
CitySanta Marta
Period16/10/1918/10/19

Keywords

  • Extension of the Job-shop scheduling problem
  • Local search
  • Pareto optimization
  • Regular criteria
  • Scheduling theory

Fingerprint Dive into the research topics of 'A General Local Search Pareto Approach with Regular Criteria for Solving the Job-Shop Scheduling Problem Multi-resource Resource Flexibility with Linear Routes'. Together they form a unique fingerprint.

  • Cite this

    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 J. C. Figueroa-García, M. Duarte-González, S. Jaramillo-Isaza, A. D. Orjuela-Cañon, & Y. Díaz-Gutierrez (Eds.), Applied Computer Sciences in Engineering - 6th Workshop on Engineering Applications, WEA 2019, Proceedings (pp. 764-775). (Communications in Computer and Information Science; Vol. 1052). Springer Healthcare. https://doi.org/10.1007/978-3-030-31019-6_64