A genetic algorithm for simultaneous lotsizing and sequencing of the permutation flow shops with sequence-dependent setups

International Journal of Computer Integrated Manufacturing

Volumn 24, Issue 1, 2011, Pages 87-93

  Mohammadi, Mohammad ^a   Ghomi, S M T Fatemi ^b   Jafari, Niloofar ^c  

^a KHARAZMI UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^c TARBIAT MODARES UNIVERSITY   (Iran)

Author keywords

capacitated lotsizing problem; genetic algorithm; permutation flow shop; sequence dependent setups

Indexed keywords

MACHINE SHOP PRACTICE;

CAPACITATED LOT SIZING PROBLEM; CAPACITY CONSTRAINTS; LOT SIZING; LOWER BOUNDS; OPTIMAL SOLUTIONS; PERMUTATION FLOW SHOPS; SEQUENCE DEPENDENT SETUPS; SEQUENCING PROBLEMS;

GENETIC ALGORITHMS;

EID: 78650596925     PISSN: 0951192X     EISSN: 13623052     Source Type: Journal    
DOI: 10.1080/0951192X.2010.511654     Document Type: Article

References (22)

1. Aloulou, M.A. and Artigues, C., 2010. Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case. Computers and Operations Research, 37 (5), 890-898.
2. Clark, A.R., 2003. Optimization approximations for capacity constrained material requirements planning. International Journal of Production Economics, 84 (2), 115-131.
3. Clark, A.R. and Clark, S.J., 2000. Rolling-horizon lot-sizing when setup times are sequence-dependent. International Journal of Production Research, 38 (10), 2287-2308.
4. Defersha, F.M. and Chen, M., 2008. A linear programming embedded genetic algorithm for an integrated cell formation and lot sizing considering product quality. European Journal of Operational Research, 187 (1), 46-69.
5. Dugardin, F., Yalaoui, F., and Amedeo, L., 2010. New multi-objective method to solve reentrant hybrid flow shop scheduling problem. European Journal of Operational Research, 203 (1), 22-31.
6. Fandel, G. and Stammen-Hegene, C., 2006. Simultaneous lot sizing and scheduling for multi-product multi-level production. International Journal of Production Economics, 104 (2), 308-316.
7. Gen, M. and Cheng, R., 1997. Genetic algorithms and engineering design. Wiley: New York.
8. Goren, H.G., Tunali, S., and Jans, R., in press. A review of applications of genetic algorithms in lot sizing. Journal of Intelligent Manufacturing.
9. Holland, J.H., 1975. Adaptation in natural and artificial systems, 2nd ed. (1992). Michigan: University of Michigan Press.
10. Jans, R. and Degraeve, Z., 2007. Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. European Journal of Operational Research, 177 (3), 1851-1875.
11. Lee, I., Sikora, R., and Shaw, M.J., 1997. A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes. IEEE Transactions, Systems, Man, Cybernetics, 27 (1), 36-54.
12. McWilliams, D.L., 2009. Genetic-based scheduling to solve the parcel hub scheduling problem. Computers and Industrial Engineering, 56 (4), 1607-1616.
13. Mohammadi, M., Fatemi Ghomi, S.M.T., Karimi, B., and Torabi, S.A., 2008. Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups. Journal of Intelligent Manufacturing, 21 (4), 501-510.
14. Mohammadi, M., Fatemi Ghomi, S.M.T., Karimi, B., and Torabi, S.A., 2009a. MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups. International Journal of Production Research, 48 (10), 2957-2973.
15. Mohammadi, M., Torabi, S.A., Fatemi Ghomi, S.M.T., and Karimi, B., 2009b. A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequence-dependent setups. International Journal of Advanced Manufacturing Technology, 49, 201-211.
16. Nagano, M.S., Ruiz, R., and Lorena, L.A.N., 2008. A constructive genetic algorithm for permutation flowshop scheduling. Computers and Industrial Engineering, 55, 195-207.
17. Palmer, D.S., 1965. Sequencing jobs through a multistage process in the minimum total time - a quick method of obtaining a near optimum. Operations Research, 16, 101-107.
18. Ribas, I., Companys, R., and Tort-Martorell, X., 2008. Comparing three-step heuristics for the permutation flow shop problem. Computers and Operations Research, 37 (12), 2062-2070.
19. Sikora, R., 1996. A genetic algorithm for integrating lotsizing and sequencing in scheduling a capacitated flow line. Computers and Industrial Engineering, 30 (4), 969-981. (Pubitemid 126375907)
20. Sikora, R., Chhajed, D., and Shaw, M.J., 1996. Integrating the lotsizing and sequencing decisions for scheduling a capacitated flow line. Computers and Industrial Engineering, 30 (4), 659-679. (Pubitemid 126375884)
21. Silver, E.A. and Meal, H.C., 1973. A heuristic selection lot size requirement for the case of a deterministic time varying demand rate and discrete opportunities for replenishment. Production and Inventory Management, 14, 64-74.
22. Zhu, X. and Wilhelm, W.E., 2006. Scheduling and lotsizing with sequence-dependent setup: a literature review. IIE Transactions, 38, 987-1007.