A MILP model for an extended version of the Flexible Job Shop Problem
| Autor: | Cristina G. Fernandes, Paulo Feofiloff, Ernesto G. Birgin, Marcio T. I. Oshiro, Everton Luiz de Melo, Débora P. Ronconi |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2014 |
| Předmět: |
FOS: Computer and information sciences
Mathematical optimization Control and Optimization Discrete Mathematics (cs.DM) Job shop scheduling Job shop Computer science Solver Directed acyclic graph Scheduling (computing) Computer Science - Data Structures and Algorithms Data Structures and Algorithms (cs.DS) PROGRAMAÇÃO DA PRODUÇÃO Computer Science - Discrete Mathematics |
| Zdroj: | Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual) Universidade de São Paulo (USP) instacron:USP |
| Popis: | A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order. The goal is the minimization of the makespan. Theoretical and practical advantages of the proposed model are discussed. Numerical experiments show the performance of a commercial exact solver when applied to the proposed model. The new model is also compared with a simple extension of the model described by \"Ozg\"uven, \"Ozbakir, and Yavuz (Mathematical models for job-shop scheduling problems with routing and process plan flexibility, Applied Mathematical Modelling, 34:1539--1548, 2010), using instances from the literature and instances inspired by real data from the printing industry. Comment: 15 pages, 2 figures, 4 tables. Optimization Letters, 2013 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|