1996
DOI: 10.1007/bf01539882
|View full text |Cite
|
Sign up to set email alerts
|

Capacitated lot-sizing with sequence dependent setup costs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
68
0
23

Year Published

2000
2000
2018
2018

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 115 publications
(91 citation statements)
references
References 9 publications
0
68
0
23
Order By: Relevance
“…Clark (2000), Staggemeier e Clark (2001), Meyr (2002), Toledo et al (2002), Araújo et al (2004), Clark (2003), Haase (1996), Haase e Kimms (2000), Rangel e Ferreira (2003) e Luche e Morabito (2005).…”
Section: Modelagemmentioning
confidence: 99%
“…Clark (2000), Staggemeier e Clark (2001), Meyr (2002), Toledo et al (2002), Araújo et al (2004), Clark (2003), Haase (1996), Haase e Kimms (2000), Rangel e Ferreira (2003) e Luche e Morabito (2005).…”
Section: Modelagemmentioning
confidence: 99%
“…This is emphasized by the fact that the assumption 1 is also made in a wide variety of different lot sizing and scheduling models (cf. [1], [11], [12], [14], [15], [16], [17], [19], [20], [25]). …”
Section: A Mixed-integer Programming Formulationmentioning
confidence: 99%
“…constant demand per period, lot scheduling problem with sequence dependent setup costs and times is introduced in [5]. In [11] th e so-called capacitated lot sizing problem with sequence dependent setup costs (CLSD) is presented. As in the PLSP, the setup State can be preserved over idle time.…”
Section: Introductionmentioning
confidence: 99%
“…In [13], the CLSD model was introduced using another strategy, consisting of introducing constraints and variables from the travelling salesman problem to map the start time and end time of production of each item in each period, to model the sequencing decisions. The CLSD model considers, originally, a single-stage system where several items have to be produced on a single machine in a finite planning horizon supposing a known dynamic deterministic demand which must be completely satisfied without backlogging.…”
mentioning
confidence: 99%
“…Therefore, various heuristic approaches have been developed to deal with the LSP. For example, [13] proposed a backward oriented heuristic to solve the LSP model without setup times, while [17] proposed a threshold accepting methaheuristic to deal with LSP considering sequence dependent setup times.…”
mentioning
confidence: 99%