Production lot sizing and scheduling with non-triangular sequence-dependent setup times

被引:16
作者
Clark, Alistair [1 ]
Mahdieh, Masoumeh [2 ]
Rangel, Socorro [3 ]
机构
[1] Univ W England, Dept Engn Design & Math, Bristol BS16 1QY, Avon, England
[2] Middlesex Univ, Sch Business, London N17 8HR, England
[3] Univ Estadual Paulista, UNESP, Dept Matemat Aplicada, Sao Jose Do Rio Preto, Brazil
基金
巴西圣保罗研究基金会;
关键词
sequence-dependent setup times; non-triangular setup times; lot sizing and scheduling; OPTIMIZATION;
D O I
10.1080/00207543.2014.885662
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper considers a production lot sizing and scheduling problem with sequence-dependent setup times that are not triangular. Consider, for example, a product that contaminates some other product unless either a decontamination occurs as part of a substantial setup time or there is a third product that can absorb 's contamination. When setup times are triangular then and there is always an optimal lot sequence with at most one lot per product per period (AM1L). However, product 's ability to absorb 's contamination presents a shortcut opportunity and could result in shorter non-triangular setup times such that . This implies that it can sometimes be optimal for a shortcut product such as to be produced in more than one lot within the same period, breaking the AM1L assumption in much research. This paper formulates and explains a new optimal model that not only permits multiple setups and lots per product in a period (ML), but also prohibits subtours using a polynomial number of constraints rather than an exponential number. Computational tests demonstrate the effectiveness of the ML model, even in the presence of just one decontaminating shortcut product, and its fast speed of solution compared to the equivalent AM1L model.
引用
收藏
页码:2490 / 2503
页数:14
相关论文
共 28 条
[1]  
[Anonymous], GUR OPT VERS 4 5 0
[2]  
[Anonymous], 2003, AMPL: A Modeling Language for Mathematical Programming
[3]  
[Anonymous], J HEURISTICS
[4]   Exact solution of large-scale, asymmetric traveling salesman problems [J].
Carpaneto, G ;
DellAmico, M ;
Toth, P .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1995, 21 (04) :394-409
[5]   Recent research trend of economic-lot scheduling problems [J].
Chan, Hing Kai ;
Chung, Sai Ho ;
Lim, Ming K. .
JOURNAL OF MANUFACTURING TECHNOLOGY MANAGEMENT, 2013, 24 (03) :465-482
[6]   Lot sizing and scheduling: industrial extensions and research opportunities [J].
Clark, Alistair ;
Almada-Lobo, Bernardo ;
Almeder, Christian .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (09) :2457-2461
[7]   Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching [J].
Clark, Alistair R. ;
Morabito, Reinaldo ;
Toso, Eli A. V. .
JOURNAL OF SCHEDULING, 2010, 13 (02) :111-121
[8]   Rolling-horizon lot-sizing when set-up times are sequence-dependent [J].
Clark, AR ;
Clark, SJ .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (10) :2287-2307
[9]   Optimization approximations for capacity constrained material requirements planning [J].
Clark, AR .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2003, 84 (02) :115-131
[10]   A NEW FORMULATION FOR THE TRAVELING SALESMAN PROBLEM [J].
CLAUS, A .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (01) :21-25