Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: The finite horizon case

Applied Mathematics and Computation

Volumn 183, Issue 1, 2006, Pages 634-645

  Akrami, B ^a   Karimi, B ^a   Moattar Hosseini, S M ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Finite horizon; Flexible flow line; Limited intermediate buffers; Lot scheduling; Metaheuristics

Indexed keywords

COMPUTATION THEORY; FINITE ELEMENT METHOD; GENETIC ALGORITHMS; INTEGER PROGRAMMING; SCHEDULING;

FINITE HORIZON; FLEXIBLE FLOW LINE; LIMITED INTERMEDIATE BUFFERS; LOT SCHEDULING; METAHEURISTICS;

PROBLEM SOLVING;

EID: 33845458698     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.05.106     Document Type: Article

References (22)

1. Dobson G., and Yano C.A. Cyclic scheduling to minimize inventory in a batch flow line. European Journal of Operational Research 75 (1994) 441-461
2. El-Najdawi M., and Kleindorfer P.R. Common cycle lot-size scheduling for multi-product, multi-stage production. Management Science 39 (1993) 872-885
3. Fatemi Ghomi S.M.T., and Torabi S.A. Extension of common cycle lot-size scheduling for multi-product, multi-stage arborescent flowshop environment. Iranian Journal of Science & Technology, Transaction B 26 B1 (2002) 55-68
4. Hsu J.I.S., and El-Najdawi M. Common cycle scheduling in a multi stage production process. Engineering Costs and Production Economics 20 (1990) 73-80
5. Ouenniche J., and Boctor F.F. Sequencing, lot sizing and scheduling of several products in job shops: the common cycle approach. International Journal of Production Research 36 4 (1998) 1125-1140
6. Ouenniche J., and Boctor F.F. The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops. International Journal of Production Research 37 10 (1999) 2253-2270
7. Ouenniche J., and Boctor F.F. The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flowshops. European Journal of Operational Research 129 (2001) 539-554
8. Ouenniche J., and Bertrand J.W.M. The finite horizon economic lot sizing problem in job shops: the multiple cycle approach. International Journal of Production Economics 74 (2001) 49-61
9. Moon I., Silver E.A., and Choi S. Hybrid genetic algorithm for the economic lot-scheduling problem. International Journal of Production Research 40 4 (2002) 809-824
10. Zipkin P. Computing optimal lot sizes in the economic lot scheduling problem. Operations Research 39 1 (1991) 56-63
11. Torabi S.A., Karimi B., and Fatemi Ghomi S.M.T. The common cycle economic lot scheduling in flexible job shops: the finite horizon case. International Journal of Production Economics 97 (2004) 52-65
12. Torabi S.A., Fatemi Ghomi S.M.T., and Karimi B. A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains. European Journal of Operational Research 173 (2006) 173-189
13. Sawik T. Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Mathematical and Computer Modeling 31 (2000) 39-52
14. Sawik T. An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Mathematical and Computer Modeling 36 (2002) 461-471
15. Wardono B., and Fathi Y. A tabu search algorithm for multi-stage parallel machine problem with limited buffer capacities. European Journal of Operational Research 155 2 (2004) 380-401
16. Hsu W. On the general feasibility test for the scheduling lot sizes for the several products on one machine. Management Science 29 (1983) 93-105
17. Gen M., and Cheng R. Genetic Algorithms and Engineering Design (1997), Wiley, New York
18. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley, MA
19. Holland J.H. Adaptation in Natural and Artificial Systems. second ed. (1992), University of Michigan Press, MIT Press
20. Brah S., and Loo L.L. Heuristics for scheduling in a flow shop with multiple processors. European Journal of Operational Research 113 (1999) 113-122
21. F. Glover, Tabu search methods in artificial intelligence and operations research, ORSA Artificial Intelligence Newsletter, 1987.
22. P. Hansen, The steepest ascent mildest descent heuristic for combinational Programming, Presented at the Congress on Numerical Methods in Combinational Programming, Capri, Italy, 1986.