2015
DOI: 10.1016/j.cor.2015.04.015
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid methods for lot sizing on parallel machines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 23 publications
(6 citation statements)
references
References 40 publications
0
5
0
1
Order By: Relevance
“…Among the various extensions of the lot-sizing problem we highlight the use of several machines to produce the items ( Fiorotto & de Araujo, 2014;Fiorotto, de Araujo, & Jans, 2015;Jans, 2009;Toledo & Armentano, 2006 ), as well as the possibility of backlogging some part of the demand ( Gruson, Cordeau, & Jans, 2017;Pochet & Wolsey, 1988 ). The setup structure in the capacity constraint is another consideration that affects the problem complexity ( Karimi et al, 2003 ).…”
Section: Discussion Of the Lot-sizing Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…Among the various extensions of the lot-sizing problem we highlight the use of several machines to produce the items ( Fiorotto & de Araujo, 2014;Fiorotto, de Araujo, & Jans, 2015;Jans, 2009;Toledo & Armentano, 2006 ), as well as the possibility of backlogging some part of the demand ( Gruson, Cordeau, & Jans, 2017;Pochet & Wolsey, 1988 ). The setup structure in the capacity constraint is another consideration that affects the problem complexity ( Karimi et al, 2003 ).…”
Section: Discussion Of the Lot-sizing Problemmentioning
confidence: 99%
“…These reformulations are strong formulations, since they provide tighter lower bounds when compared with the original formulations. Extensions of these reformulations have been successfully applied to obtain further improved lower bounds ( de Araujo & Clark, 2013;de Araujo, de Reyck, Degraeve, Fragkos, & Jans, 2015;Fiorotto et al, 2015;Jans & Degraeve, 2004;Süral, Denizel, & Wassenhove, 2009 ).…”
Section: Discussion Of the Lot-sizing Problemmentioning
confidence: 99%
“…Fiorotto and de Araujo [13] applied a Lagrangian heuristic based on the relaxation of the demand constraints in order to find good feasible solutions. Fiorotto et al [14] proposed hybrid methods using Lagrangian relaxation and Dantzig-Wolfe decomposition and found better lower and upper bounds compared to Toledo and Armentano [47] and Fiorotto and de Araujo [13]. Recently, Vincent et al [49] developed a meta-heuristic based on the relaxation of the capacity constraints to explore the set of solutions and obtain more feasible solutions.…”
Section: Capacited Lot-sizing With Multiple Resourcesmentioning
confidence: 99%
“…There are several practical applications where parallel machines need to be taken into account, for example, the tire industry (Jans and Degraeve [22]), bottling of liquids (Carreno [8]) and pharmaceutical industry (Matta and Guignard [36]). In the standard design for lot sizing problems, each machine can manufacture all products, meaning the total or complete flexibility (Fiorotto et al [14], Toledo and Armentano [47]). However, it can be expensive to implement machines with total flexibility for several practical applications.…”
Section: Introductionmentioning
confidence: 99%
“…Na formulação clássica do problema de dimensionamento de lotes com máquinas paralelas [1], considera-se que cada máquina pode fabricar todos os produtos, essa configuração de flexibilidade é chamada flexibilidade total. Observe que quanto mais itens uma máquina puder fabricar (isso é, quanto mais flexível ela for), maior é o investimento necessário em tecnologia, desta forma, é preciso buscar configurações que sejam eficientes e econômicas.…”
unclassified