Evaluating artificial intelligence heuristics for a flexible Kanban system: Simultaneous Kanban controlling and scheduling

International Journal of Production Research

Volumn 45, Issue 13, 2007, Pages 2859-2873

  Lee, I ^a  

^a WESTERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Flexible Kanban system; Heuristics; Kanban controlling; Scheduling; Search; Sequencing

Indexed keywords

FLEXIBLE KANBAN SYSTEM; KANBAN CONTROLLING; MACHINING COSTS; SEQUENCING;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS; SCHEDULING; TABU SEARCH;

JUST IN TIME PRODUCTION;

EID: 34249076323     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540600806505     Document Type: Article

References (43)

1. Abdou, G. and Dutta, S.P., A systematic simulation approach for the design of JIT manufacturing systems. J. Op. Manage., 1993, 11(3), 225-238.
2. Askin, R.G., Mitwasi, M.G. and Goldberg, J.D., Determining the number of Kanbans in multi-item Just-In-Time systems. IIE Trans., 1993, 25(1), 89-98.
3. Azisi, N. and Zolfaghari, S., Adaptive temperature control for simulated annealing: a comparative study. Comp. & Op. Res., 2004, 31(14), 2439-2451.
4. Badinelli, R.D., A model for continuous-review pull policies in serial inventory systems. Op. Res., 1992, 40(1), 142-156.
5. Berkley, B.J., Simulation tests of FCFS and SPT sequencing in Kanban systems. Dec. Sci., 1993, 24(1), 218-227.
6. Berkley, B.J. and Kiran, A.S., A simulation study of sequencing rules in a Kanban-controlled flow shop. Dec. Sci., 1991, 22(3), 559-582.
7. Bowden, R.O., Hall, J.D. and Usher, J.M., Integration of evolutionary programming and simulation to optimise a pull production system. Comp. & Indust. Eng., 1996, 31(1-2), 217-220.
8. Cleveland, G.A. and Smith, S.F., Using genetic algorithms to schedule flow shop releases, in Proceedings of the Third International Conference on Genetic Algorithms and Their Applications, Arlington, VA, 1989, pp. 160-169.
9. Dell'Amico, M. and Trubian, M., Applying tabu search to the job-shop scheduling problem. Ann. Op. Res., 1993, 41, 231-252.
10. Faaland, B. and Schmitt, T., Scheduling tasks with due dates in a fabrication/assembly process. Op. Res., 1987, 35(3), 378-388.
11. Framinan, J.M., Gonzales, P.L. and Ruiz-Usano, R., Dynamic card controlling in a Conwip system. Int. J. Prod. Econ., 2006, 99(1/2), 102-116.
12. Framinan, J.M., Gonzales, P.L. and Ruiz-Usano, R., The Conwip production control system: Review and research issues. Prod. Plan. & Cont., 2003, 14(3), 255-265.
13. Fukukawa, T. and Hong, S-C., The determination of the optimum number of Kanbans in a just-in-time production system. Comp. & Indust. Eng., 1993, 24(4), 551-559.
14. Groenevelt, H. and Karmarkar, U., A dynamic kanban system case study. Prod. & Invent. Manage., 1988, 29(2), 46-50.
15. Gupta, M., Al-Turki, Y.A. and Perry, R.F., Flexible kanban system. Int. J. Op. & Prod. Manage., 1999, 19(10), 1065-1093.
16. Haouari, M. and Ladhari, T., A branch-and-bound-based local search method for the flow shop problem. J. Op. Res. Soc., 2003, 54(10), 1076-1084.
17. Huang, P., Rees, L. and Taylor, B., A simulation analysis of the Japanese just-in-time technique (with Kanbans) for a multi-line, multi-stage production system. Dec. Sci., 1983, 14(3), 326-344.
18. Hum, S.H. and Lee, C.K., IT scheduling rules: a simulation evaluation. Omega., 1998, 26(3), 381-395.
19. Lummus, R.R., A simulation analysis of sequencing alternatives for JIT lines using Kanbans. J. Op. Manage., 1995, 13(3), 183-191.
20. Malek, M., Guruswamy, M. and Pandya, M., Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Ann. Op. Res., 1989, 21, 59-84.
21. Markham, I.S., Mathieu, R.G. and Wray, B.A., A rule induction approach for determining the number of kanbans in a just-in-time production system. Comp. Indust. Eng., 1998, 34(4), 717-727.
22. Matsuo, H., Suh, C.J. and Sullivan, R.S., A controlled search simulated annealing method for the single machine weighted tardiness problem. Ann. Op. Res., 1989, 21, 85-108.
23. Moeeni, F. and Chang, Y.-L., An approximate solution to deterministic Kanban systems. Dec. Sci., 1990, 21(3), 596-607.
24. Monden, Y., Toyota Production System: Practical Approach to Production Management, 1983 (Industrial Engineering and Management Press: Atlanta).
25. max flowshop problem. Comp. Op. Res., 1990, 17(3), 243-253.
26. Osman, I.H. and Potts, C.N., Simulated annealing for permutation flow-shop scheduling. OMEGA, 1989, 17(6), 551-557.
27. Rakes, T.R., Rees, L.P., Siochi, F.C. and Wray, B.A., Estimating the number of kanbans using neural networks. Adv. Artif. Intel. Econ., Finance and Manage., 1994, 1, 125-139.
28. Rees, L., Philipoom, P., Taylor, B. and Huang, P., Dynamically adjusting the number of kanbans in a just-in-time production system using estimated values of leadtime. IIE Trans., 1987, 19(2), 199-207.
29. Sarker, B.R. and Balan, C.V., Operations planning for a multi-stage kanban system. Euro. J. Op. Res., 1999, 112(2), 284-303.
30. Sidney, J.B., Optimal single-machine scheduling with earliness and tardiness penalties. Op. Res., 1977, 25, 62-69.
31. Stevenson, W.J., Production/Operations Management, 5th ed., 1996 (Irwin: Homewood, IL).
32. Syswerda, G. and Palmucci, J., 1991, The application of genetic algorithms to resource scheduling, in Proceedings of the Fourth International Conference on Genetic Algorithms and Their Applications, San Diego, CA, pp. 502-508.
33. Taillard, E.D., Some efficient heuristic methods for the flow shop sequencing problem. Euro, J. Op. Res., 1990, 47, 65-74.
34. Taillard, E.D., Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Comp., 1994, 6(2), 108-117.
35. Takahashi, K., Comparing reactive Kanban systems. Int. J. Prod. Res., 2003, 41(18), 4317-4337.
36. Takahashi, K. and Nakamura, N., Reacting JIT ordering systems to the unstable changes in demand. Int. J. Prod. Res., 1999, 37(10), 2293-2313.
37. Tardif, V. and Maaseidvaag, L., An adaptive approach to controlling Kanban systems. Euro. J. Op. Res., 2001, 132(2), 411-424.
38. Trevino, J. and McGinnis, L.F., Electronic spreadsheet implementation of a lot sizing procedure for a single-card Kanban system. Comp. & Indust. Eng., 1986, 11(1-4), 340-345.
39. Wang, H.F. and Wu, K.U., Hybrid genetic algorithm for optimisation problems with permutation property. Comp. & Op. Res., 2004, 31(14), 2453-2471.
40. Yamada, T. and Nakano, R.A., Genetic algorithm application to large-scale job-shop problems. In Parallel Problem Solving from Nature 2, edited by R. Mânner and B. Manderick, pp. 281-290, 1992 (Elsevier Science Publishers B.V.: Amsterdam).
41. Yang, T. and Kuo, Y., Tabu-search simulation optimisation approach for flow-shop scheduling with multiple processors - a case study. Int. J. Prod. Res., 2004, 42(19), 4015-4030.
42. Yoon, S.H. and Ventura, J.A., Minimising the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling. Comp. & Op. Res., 2002, 29(10), 1301-1315.
43. Zipkin, P., Does manufacturing need a JIT revolution? Harvard Business Review, 1991, January-February, 40-50.