Asynchronous teams for joint lot-sizing and scheduling problem in flow shops

International Journal of Production Research

Volumn 50, Issue 20, 2012, Pages 5809-5822

  Filho, Márcio A F Belo ^a   Santos, Maristela O ^a   Meneses, Cláudio N ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSIDADE FEDERAL DO ABC   (Brazil)

Author keywords

asynchronous team; flow shop; lot sizing; scheduling

Indexed keywords

ASYNCHRONOUS TEAM; FEASIBLE SOLUTION; FLOW-SHOPS; INTEGRATED PRODUCTION; LOT SIZING; LOT SIZING PROBLEMS; MACHINE SETUP; MIXED INTEGER PROGRAMMING; PLANNING HORIZONS; PROBLEM INSTANCES; PRODUCTION AND INVENTORY; PRODUCTION LINE; PRODUCTION LOT SIZE; PRODUCTION SCHEDULE; SCHEDULING PROBLEM; SEQUENCE-DEPENDENT;

MACHINE SHOP PRACTICE; MATHEMATICAL MODELS; PRODUCTION ENGINEERING; SCHEDULING;

PRODUCTION CONTROL;

EID: 84867357938     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.628955     Document Type: Article

References (26)

1. Almada-Lobo, B., 2007. Single machine multi-product capacitated lot sizing with sequence-dependent setups. International Journal of Production Research, 45 (20), 4873-4894.
2. de Souza, P.S., 1993. Asynchronous organizations for multi-algorithm problems. Pittsburgh, PA: Carnegie Mellon University.
3. de Souza, P.S. and Talukdar, S.N., 1993. Asynchronous organizations for multialgorithm problems. In: Proceedings of the 1993 ACM/SIGAPP symposium on applied computing: States of the art and practice, SAC '93, Indianapolis, Indiana, United States ACM, 286293.
4. Dolan, E.D. and Moré, J.J., 2002. Benchmarking optimization software with performance profiles. Mathematical Programming, 91 (2), 201-213.
5. Drexl, A. and Kimms, A., 1997. Lot sizing and scheduling: Survey and extensions. European Journal of Operational Research, 99 (2), 221-235.
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. Gupta, D. and Magnusson, T., 2005. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers & Operations Research, 32 (4), 727-747.
8. Karimi, B., Fatemi Ghomi, S.M.T., and Wilson, J.M., 2003. The capacitated lot sizing problem: A review of models and algorithms. Omega, 31 (5), 365-378.
9. 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 on Systems, Man, and Cybernetics, Part B, 27 (1), 36-54.
10. Meneses, C.N., Pardalos, P.M., and Ragle, M., 2008. Asynchronous Teams for probe selection problems. Discrete Optimization, 5 (10), 74-87.
11. Mercé, C. and Fontan, G., 2003. MIP-based heuristics for capacitated lotsizing problems. International Journal of Production Economics, 85 (1), 97-111.
12. Mohammadi, M. and Fatemi Ghomi, S.M.T., 2011. Genetic algorithm-based heuristic for capacitated lotsizing problem in flow shops with sequence-dependent setups. Expert Systems with Applications, 38 (6), 7201-7207.
13. Mohammadi, M., et al., 2010a. MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups. International Journal of Production Research, 48 (10), 2957-2973.
14. Mohammadi, M., et al., 2010b. A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequencedependent setups. The International Journal of Advanced Manufacturing Technology, 49 (1), 201-211.
15. Mohammadi, M., et al., 2010c. 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.
16. Mohammadi, M., Fatemi Ghomi, S.M.T., and Jafari, N., 2011. A genetic algorithm for simultaneous lotsizing and sequencing of the permutation flow shops with sequence-dependent setups. International Journal of Computer Integrated Manufacturing, 24 (1), 87-93.
17. Nawaz, M., Enscore Jr, E.E., and Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega - The International Journal of Management Science, 11 (1), 91-95.
18. Park, S. and Miller, K., 1988. Random number generators: Good ones are hard to find. Communications of the ACM, 31 (10), 1192-1201.
19. Potts, C.N. and Van Wassenhove, L.N., 1992. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of Operational Research Society, 43 (5), 395-406.
20. Sikora, R., 1996. A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Computers and Industrial Engineering, 30 (4), 969-981.
21. Sikora, R., Chhajed, D., and Shaw, M.J., 1996. Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line. Computers and Industrial Engineering, 30 (4), 659-679.
22. Talukdar, S.N., Pyo, S.S., and Giras, T.C., 1983. Asynchronous procedures for parallel processing. IEEE Transactions on Power Apparatus and Systems, PAS-102 (11), 3652-3659.
23. Talukdar, S., et al., 1998. Asynchronous Teams: Cooperation schemes for autonomous agents. Journal of Heuristics, 4 (4), 295-321.
24. Talukdar, S., Murthy, S., and Akkiraju, R., 2003. Asynchronous Teams. In: F. Glover and G.A. Kochenberger, eds. Handbook of metaheuristics. New York: Springer, 537-556.
25. Wolsey, L.A., 1998. Integer programming. New York: Wiley.
26. Zhu, X. and Wilhelm, W.E., 2006. Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions, 38 (11), 987-1007.