Mathematical models and resolution strategies for the classical job shop problem

Author(s)

Sergio Gomez Morales ^[1] ; Débora Pretti Ronconi ^[2]

Affiliation

^[1] Universidade de São Paulo - Brasil

^[2] Universidade de São Paulo - Brasil

• Document type: Journal article
• Source: Production; v. 26, n. 3, p. 614-625, 2015-12-22.

Abstract

Abstract The scheduling problem in a job shop production environment is characterized by containing n jobs to be processed by m machines, where each job is represented by a specific sequence of operations with an established precedence order. The aim of this work is to perform a comparative analysis of the mathematical formulations for this environment by minimizing the makespan, i.e., the total time to complete all n jobs. Popular models and a proposed model are compared and evaluated through computational tests using cases from the literature. In addition, resolution strategies are proposed. Computational experiments using a well-known commercial software package indicate that the proposal strategies can promote a reduction of the optimality gap. (AU)

• FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
• Grantee: Francisco Louzada Neto
• Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
• FAPESP's process: 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings
• Grantee: Reinaldo Morabito Neto
• Support Opportunities: Research Projects - Thematic Grants