A variable redefinition approach for the lot sizing problem with strong set-up interactions

IIE Transactions (Institute of Industrial Engineers)

Volumn 33, Issue 5, 2001, Pages 357-370

  Bhatia, M ^a   Palekar, U S ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; LINEAR EQUATIONS; MANUFACTURE; MATHEMATICAL MODELS; POLYNOMIALS; PRODUCTION ENGINEERING; THEOREM PROVING;

JOINT REPLENISHMENT PROBLEM; LOT SIZING PROBLEM; STRONG INTERACTION PROBLEM; VARIABLE REDEFINITION APPROACH;

OPERATIONS RESEARCH;

EID: 0035340464     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011035328466     Document Type: Article

References (12)

1. Multi-item inventory models with co-ordinated replenishments
2. Computational complexity of uncapacitated multi-echelon production planning problems
3. Computational complexity of uncapacitated multi-echelon production planning problems
4. Solving multi-item capacitated lot-sizing problem using variable redefinition
5. The joint replenishment problem with time varying costs and demands: Efficient asymptotic and ε optimal solutions
6. A linear programming approach to the cutting stock problem: Part II
7. Generating alternate mixed-integer programming models using variabe redefinition
8. Uncapacitated lotsizing problems with setup interactions
9. A dual ascent procedure for the joint replenishment problem
10. Lotsizing problems with strong set-up interactions
11. Dynamic version of the economic lot size model
12. A deterministic multi-period production scheduling model with backlogging