A MILP model for an extended version of the Flexible Job Shop Problem

作者：Birgin Ernesto G^*; Feofiloff Paulo; Fernandes Cristina G; de Melo Everton L; Oshiro Marcio T I; Ronconi Debora P

来源：Optimization Letters, 2014, 8(4): 1417-1431.

DOI：10.1007/s11590-013-0669-7

• Scheduling
• Flexible Job Shop Problem
• MIP models

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 Ozguven et al. (Appl Math Modell 34:1539-1548, 2010), using instances from the literature and instances inspired by real data from the printing industry.

• 出版日期2014-4