An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines

被引：15

作者：

Anderson, Bradley E. ^{[1
]}

Blocher, James D. ^{[2
]}

Bretthauer, Kurt M. ^{[2
]}

Venkataramanan, Munirpallam A. ^{[2
]}

机构：

[1] USAF, Dept Operat Sci, Inst Technol, Wright Patterson AFB, OH 45433 USA

[2] Indiana Univ, Dept Operat & Decis Technol, Kelley Sch Business, Bloomington, IN 47405 USA

来源：

MATHEMATICAL AND COMPUTER MODELLING | 2013年 / 57卷 / 3-4期

关键词：

Sequence-dependent setups; Scheduling; Mixed integer programming; Earliness; Tardiness; MULTIPLE TIME WINDOWS; TARDINESS PENALTIES; EARLINESS;

D O I：

10.1016/j.mcm.2012.06.029

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper compares the efficacy of a newly developed network-based mixed-integer programming (MIP) formulation with three existing formulations for the sequence dependent setup scheduling problem with earliness/tardiness penalties. This research shows that the new model is more efficient in terms of computation time for larger multi-machine problems than the existing formulations of these problems. The mixed-integer nature of the formulation allows companies to solve this class of problems with any one of many commonly available integer programming software packages. The presented MIP formulation provides a unique and useful method of conceptualizing and modeling a practical, yet difficult, problem within industry. Published by Elsevier Ltd

引用

页码：483 / 493

页数：11

共 10 条

[1]

Baker K. R., 1974, Introduction to Sequencing and Scheduling"

[2] Early/tardy scheduling with sequence dependent setups on uniform parallel machines [J].

Balakrishnan, N ;

Kanet, JJ ;

Sridharan, V .

COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (02) :127-141

[3] Scheduling with batch setup times and earliness-tardiness penalties [J].

Chen, ZL .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) :518-537

[4] Robust ship scheduling with multiple time windows [J].

Christiansen, M ;

Fagerholt, K .

NAVAL RESEARCH LOGISTICS, 2002, 49 (06) :611-625

[5]

Coleman B. J., 1992, Production and Operations Management, V1, P225, DOI 10.1111/j.1937-5956.1992.tb00354.x

[6]

Panwalkar S.S., 1973, S THEORY SCHEDULING, P29

[7] On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem [J].

Pesant, G ;

Gendreau, M ;

Potvin, JY ;

Rousseau, JM .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 117 (02) :253-263

[8] Parallel machine scheduling with earliness and tardiness penalties [J].

Sivrikaya-Serifoglu, F ;

Ulusoy, G .

COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (08) :773-787

[9] Scheduling and lot sizing with sequence-dependent setup: A literature review [J].

Zhu, Xiaoyan ;

Wilhelm, Wilbert E. .

IIE TRANSACTIONS, 2006, 38 (11) :987-1007

[10] Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach [J].

Zhu, ZW ;

Heady, RB .

COMPUTERS & INDUSTRIAL ENGINEERING, 2000, 38 (02) :297-305

← 1 →