Back to Search
Start Over
A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- Source :
- Journal of the Operational Research Society. 57:1231-1240
- Publication Year :
- 2006
- Publisher :
- Informa UK Limited, 2006.
-
Abstract
- This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time.
- Subjects :
- Marketing
Operations research
Computer science
Heuristic (computer science)
Heuristic
Strategy and Management
Computation
0211 other engineering and technologies
Scheduling (production processes)
Holding cost
Time horizon
02 engineering and technology
Management Science and Operations Research
Management Information Systems
Scheduling (computing)
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Heuristics
Integer programming
021106 design practice & management
Subjects
Details
- ISSN :
- 14769360 and 01605682
- Volume :
- 57
- Database :
- OpenAIRE
- Journal :
- Journal of the Operational Research Society
- Accession number :
- edsair.doi...........325d8a4c6a15aa564c3314004590148d