Efficient priority rules that explore flexible job shop characteristics for minimizing total tardiness

Author(s)

Everton Luiz de Melo ^[1] ; Débora Pretti Ronconi ^[2]

Affiliation

^[1] USP - Brasil

^[2] USP - Brasil

• Document type: Journal article
• Source: Production; v. 25, n. 1, p. 79-91, 2014-04-01.

Abstract

This paper presents heuristic strategies that exploit characteristics of the Flexible Job Shop (FJS) environment, an extended version of the NP-hard job-shop problem. The FJS involves a set of jobs composed of operations, and each operation must be processed on a machine that can process it. The criterion is the minimization of total tardiness. Initially, characteristics related to the production system flexibility or, more precisely, characteristics related to the machines that can process each operation and the machines' processing times are identified. Therefore, rules that explore these characteristics and foresee future states of the system are proposed. Computational experiments are conducted with 600 instances. Comparisons with rules from the literature show that the best heuristic proposed outperforms the best known rule in approximately 81 percent of instances. (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