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

被引：0

作者：

Ernesto G. Birgin

Paulo Feofiloff

Cristina G. Fernandes

Everton L. de Melo

Marcio T. I. Oshiro

Débora P. Ronconi

机构：

[1] IME,Department of Computer Science

[2] University of São Paulo,Department of Production Engineering

[3] EPUSP,undefined

[4] University of São Paulo,undefined

来源：

Optimization Letters | 2014年 / 8卷

关键词：

Scheduling; Flexible Job Shop Problem; MIP models;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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

引用

页码：1417 / 1431

页数：14

共 29 条

[1]

Alvarez-Valdés R(2005)A heuristic to schedule flexible job-shop in a glass factory Eur. J. Oper. Res. 165 525-534

[2]

Fuertes A(1993)Routing and scheduling in a flexible job shop by tabu search Ann. Oper. Res. 41 157-183

[3]

Tamarit JM(2006)Flexible job-shop scheduling problem under resource constraints Int. J. Prod. Res. 44 2071-2089

[4]

Giménez G(2007)Mathematical modeling and heuristic approaches to flexible job shop scheduling problems J. Intell. Manuf. 18 331-342

[5]

Ramos R(2011)Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem Knowl. Sys. 24 102-112

[6]

Brandimarte P(1976)The complexity of flowshop and jobshop scheduling Math. Oper. Res. 1 117-129

[7]

Chan FTS(1960)On the job-shop scheduling problem Oper. Res. 8 219-223

[8]

Wong TC(1989)Simulation modeling of batch job shop type flexible manufacturing systems J. Mech. Work. Technol. 20 441-450

[9]

Chan LY(2010)Mathematical models for job-shop scheduling problems with routing and process plan flexibility Appl. Math. Model. 34 1539-1548

[10]

Fattahi P(2008)A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem Eur. J. Oper. Res. 190 398-411

← 1 2 3 →