A hyperheuristic approach for intercell scheduling with single processing machines and batch processing machines

IEEE Transactions on Systems, Man, and Cybernetics: Systems

Volumn 45, Issue 2, 2015, Pages 315-325

  Li, Dongni ^a   Li, Miao ^a   Meng, Xianwen ^a   Tian, Yunna ^a,b  

^a BEIJING INSTITUTE OF TECHNOLOGY   (China)

^b YAN'AN UNIVERSITY   (China)

Author keywords

Management decision making; manufacturing scheduling; optimization methods; production management

Indexed keywords

ANT COLONY OPTIMIZATION; BATCH DATA PROCESSING; CELLULAR MANUFACTURING; COMPUTATIONAL EFFICIENCY; DECISION MAKING; GENETIC ALGORITHMS;

ANT COLONY OPTIMIZATION (ACO); BATCH PROCESSING MACHINE; COMPUTATIONAL RESULTS; MANAGEMENT DECISION-MAKING; MANUFACTURING SCHEDULING; OPTIMIZATION METHOD; PROCESSING MACHINES; PRODUCTION MANAGEMENT;

SCHEDULING;

EID: 84921418135     PISSN: 21682216     EISSN: 21682232     Source Type: Journal    
DOI: 10.1109/TSMC.2014.2332443     Document Type: Article

References (30)

1. O. Garza and T. L. Smunt, "Countering the negative impact of intercell flow in cellular manufacturing," J. Oper. Manag., vol. 10, no. 1, pp. 92-118, Jan. 1991.
2. W. H. Yang and C. J. Liao, "Group scheduling on two cells with intercell movement," Comput. Oper. Res., vol. 23, no. 10, pp. 997-1006, Oct. 1996.
3. M. Solimanpur, P. Vrat, and R. Shankar, "A heuristic to minimize makespan of cell scheduling problem," Int. J. Prod. Econ., vol. 88, no. 3, pp. 231-241, Apr. 2004.
4. R. Tavakkoli-Moghaddam, N. Javadian, A. Khorrami, and Y. Gholipour-Kanani, "Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system," Expert Syst. Appl., vol. 37, no. 3, pp. 2661-2669, Mar. 2010.
5. A. Golmohammadi and R. Ghodsi, "Applying an integer electromagnetism-like algorithm to solve the cellular manufacturing scheduling problem with an integrated approach," in Proc. Comput. Ind. Eng. (CIE), Troyes, France, 2009, pp. 34-39.
6. J. F. Tang, X. Q. Wang, I. Kaku, and K. L. Yung, "Optimization of parts scheduling in multiple cells considering intercell move using scatter search approach," J. Intell. Manuf., vol. 21, no. 4, pp. 525-537, Aug. 2010.
7. A. Elmi, M. Solimanpur, S. Topaloglu, and A. Elmi, "A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts," Comput. Ind. Eng., vol. 61, no. 1, pp. 171-178, Aug. 2011.
8. D. N. Li, Y. Wang, G. X. Xiao, and J. F. Tang, "Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes," Comput. Oper. Res., vol. 1, no. 14, pp. 1207-1223, May 2013.
9. D. N. Li, X. W. Meng, M. Li, and Y. Tian, "An ACO-based intercell scheduling approach for job shop cells with multiple single processing machines and one batch processing machine," J. Intell. Manuf., online publication. DOI: 10.1007/s10845-013-0859-2
10. D. J. Johnson and U. Wemmerlov, "Why does cell implementation stop Factors influencing cell penetration in manufacturing plants," Prod. Oper. Manag., vol. 13, no. 3, pp. 272-289, Sep. 2004.
11. L. R. Foulds, A. P. French, and J. M. Wilson, "The sustainable cell formation problem: Manufacturing cell creation with machine modification costs," Comput. Oper. Res., vol. 33, no. 4, pp. 1010-1032, Apr. 2006.
12. M. Murugan and V. Selladurai, "Optimization and implementation of cellular manufacturing system in a pump industry using three cell formation algorithms," Int. J. Adv. Manuf. Technol., vol. 35, nos. 1-2, pp. 135-149, Nov. 2007.
13. J. N. D. Gupta and J. E. Schaller, "Minimizing flow time in a flow-line manufacturing cell with family setup times," J. Oper. Res. Soc., vol. 57, no. 2, pp. 163-176, Feb. 2006.
14. C. H. Tsai and R. K. Li, "A due-date oriented scheduling heuristic for job shop cellular manufacturing system," Int. J. Ind. Eng. Theory., vol. 7, no. 1, pp. 76-88, Mar. 2000.
15. W. M. Shen, L. H.Wang, and Q. Hao, "Agent-based distributed manufacturing process planning and scheduling: A state-of-The-Art survey," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 36, no. 4, pp. 563-577, Jul. 2006.
16. A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov, "A survey of scheduling problems with setup times or costs," Eur. J. Oper. Res., vol. 187, no. 3, pp. 985-1032, Jun. 2008.
17. S. Malve and R. Uzsoy, "A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families," Comput. Oper. Res., vol. 34, no. 10, pp. 3016-3028, Oct. 2007.
18. P. Damodaran, P. K. Manjeshwar, and K. Srihari, "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," Int. J. Prod. Econ., vol. 103, no. 2, pp. 882-891, Oct. 2006.
19. R. Ruiz and J. A. Vazquez-Rodriguez, "The hybrid flow shop scheduling problem," Eur. J. Oper. Res., vol. 205, no. 1, pp. 1-18, Aug. 2010.
20. S. C. Park, N. Raman, and M. J. Shaw, "Adaptive scheduling in dynamic flexible manufacturing systems: A dynamic rule selection approach," IEEE Trans. Robot. Autom., vol. 13, no. 4, pp. 486-502, Aug. 1997.
21. R. L. Laforge and S. Barman, "Performance of simple priority rule combinations in a flow dominant shop," Prod. Inventory Manag. J., vol. 30, no. 3, pp. 1-4, 1989.
22. H. Sarper and M. C. Henry, "Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop," Omega, vol. 24, no. 1, pp. 73-81, Feb. 1996.
23. S. Barman, "Simple priority rule combinations: An approach to improve both flow time and tardiness," Int. J. Prod. Res., vol. 35, no. 10, pp. 2857-2870, Oct. 1997.
24. U. Dorndorf and E. Pesch, "Evolution based learning in a job-shop scheduling environment," Comput. Oper. Res., vol. 22, no. 1, pp. 25-40, Jan. 1995.
25. J. A. Vazquez-Rodriguez and S. Petrovic, "A new dispatching rule based genetic algorithm for the multi-objective job shop problem," J. Heuristics, vol. 16, no. 6, pp. 771-793, Dec. 2010.
26. C. Fayad and S. Petrovic, "A fuzzy genetic algorithm for real-world job shop scheduling," in Proc. 18th Ind. Eng. Appl. Artif. Intell. Expert Syst. (IEA/AIE), Bari, Italy, Jun. 2005, pp. 524-533.
27. S. G. Ponnambalam, V. Ramkumar, and N. Jawahar, "A multiobjective genetic algorithm for job shop scheduling," Prod. Plan. Control, vol. 12, no. 8, pp. 764-774, Dec. 2001.
28. T. Stutzle and H. Hoos, "Max-min ant system and local search for the traveling salesman problem," in Proc. IEEE Int. Conf. Evol. Comput. (ICEC), Indianapolis, IN, USA, 1997, pp. 309-314.
29. K. L. Huang and C. J. Liao, "Ant colony optimization combined with taboo search for the job shop scheduling problem," Comput. Oper. Res., vol. 35, no. 4, pp. 1030-1046, Apr. 2008.
30. Y. A. Youssef, Y. Beauchamp, and M. Thomas, "Comparison if a full factorial experiment to fractional and taguchi designs in a lathe dry turning operation," Comput. Ind. Eng., vol. 27, nos. 1-4, pp. 59-62, Sep. 1994.