Exact and heuristic procedures for capacity expansion problems with congestion

The problem of determining an optimal capacity expansion and contraction schedule over time for production resources subject to congestion is addressed. Previous to this work non-linear constraints based on expected queue length have been used to represent congestion, whereas concave clearing functi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IIE transactions Ročník 40; číslo 12; s. 1185 - 1197
Hlavní autoři: Kim, Sukgon, Uzsoy, Reha
Médium: Journal Article
Jazyk:angličtina
Vydáno: Norcross Taylor & Francis Group 01.12.2008
Taylor & Francis Ltd
Témata:
Branch & bound algorithms
branch and price
Capacity expansion
clearing functions
column generation
Heuristic
heuristics
Problem solving
Production scheduling
Studies
ISSN:0740-817X, 2472-5854, 1545-8830, 2472-5862
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The problem of determining an optimal capacity expansion and contraction schedule over time for production resources subject to congestion is addressed. Previous to this work non-linear constraints based on expected queue length have been used to represent congestion, whereas concave clearing functions that capture the relationship between expected throughput and expected work in process inventory in a planning period are used in this paper. A column generation procedure that uses a previously developed pseudo-polynomial-time algorithm for the single-workcenter problem to generate new columns is proposed. The fractional solution obtained by column generation is then used to construct a feasible solution. Computational experiments on randomly generated test problems show that the procedure consistently produces near-optimal solutions in modest CPU times. The column generation formulation is also used to obtain lower bounds in an exact branch-and-bound algorithm, and it is shown that this new procedure is able to solve problems that are significantly larger than those possible with previous methods.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0740-817X
2472-5854
1545-8830
2472-5862
DOI:10.1080/07408170802322978