The finite horizon economic lot sizing problem in job shops: The multiple cycle approach

International Journal of Production Economics

Volumn 74, Issue 1-3, 2001, Pages 49-61

  Ouenniche, J ^a,b   Bertrand, J W M ^b  

^a LAKEHEAD UNIVERSITY   (Canada)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Cyclic scheduling; Job shop; Lot sizing; Sequencing

Indexed keywords

DECISION THEORY; INTEGER PROGRAMMING; JOB ANALYSIS; SCHEDULING;

LOT SIZING PROBLEM;

PROBLEM SOLVING;

EID: 0035546154     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(01)00106-2     Document Type: Article

References (14)

1. Sequencing, lot sizing and scheduling of several products in job shops: The common cycle approach
2. Job shop scheduling by implicit enumeration
3. A state-of-the-art survey of dispatching rules for manufacturing job shop operations
4. Sequencing rules and due-date assignments in a job shop
5. Priority rules for job shops with weighted tardiness costs
6. The shifting bottleneck procedure for job shop scheduling
7. An algorithm for solving the job shop problem
8. Two new rules to minimize tardiness in a job shop
9. Job shop scheduling by simulated annealing
10. Multiproduct optimal batch sizes with in-process inventories and multi work centers
11. Lotsizing in multi-item multi-machine job shops
12. ACLIPS: A capacity and lead time integrated procedure for scheduling
13. Robust taboo search for the quadratic assignment problem