A search heuristic for the sequence-dependent economic lot scheduling problem

European Journal of Operational Research

Volumn 141, Issue 1, 2002, Pages 133-146

  Wagner, Bret J ^a   Davis, Darwin J ^b  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

^b UNIVERSITY OF DELAWARE   (United States)

Author keywords

Heuristics; Lot sizing; Optimization; Scheduling theory; Traveling salesman

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

ECONOMIC LOT SCHEDULING PROBLEM (ELSP);

SCHEDULING;

EID: 0037125656     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00265-X     Document Type: Article

References (19)

1. A dynamic programming approach to a lot size scheduling problem
2. A comparison of solution approaches for the fixed-sequence economic lot scheduling problem
3. Lot sizing and sequencing for N products on one facility
4. The economic lot-scheduling problem: Achieving feasibility using time-varying lot sizes
5. The cyclic lot scheduling problem with sequence-dependent setups
6. An iterative procedure for the single-machine multi-product lot scheduling problem
7. The economic lot scheduling problem (ELSP): Review and extensions
8. A note on scheduling a multi-product single machine system for an infinite planning period
9. A note on the single-machine multi-product lot scheduling problem
10. The use of genetic algorithms to solve the economic lot size scheduling problem
11. An effective heuristic algorithm for the traveling-salesman problem
12. Scheduling a multi-product single machine system for an infinite planning period
13. The scheduling of economic lot sizes
14. A computational approach to the economic lot scheduling problem