Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system

Annals of Operations Research

Volumn 78, Issue , 1998, Pages 201-217

  Martin, Andrew D ^a   Chang, Te Min ^b   Yih, Yeuhwern ^b   Kincaid, Rex K ^c  

^a WASHINGTON UNIVERSITY   (United States)

^b SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

^c The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032390295     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018950016849     Document Type: Article

References (23)

1. D.H. Ackley, An empirical study of bit vector optimization, in: Genetic Algorithms and Simulated Annealing, L. Davis, ed., Pittman, London, 1987, pp. 170-204
2. B. Adenso-Díaz, Restricted neighborhood in the tabu search for the flowshop problem, European Journal of Operational Research 62(1992)27-37.
3. E.J. Anderson, Mechanisms for local search: Is first-improving best, Working Paper, Judge Institute of Management Studies, University of Cambridge, Cambridge CB2 1RX, UK, 1993.
4. J.W. Barnes and M. Laguna, A tabu search experience in production scheduling, Annals of Operations Research 41(1993)141-156.
5. P. Brandimarte, Routing and scheduling in a flexible job shop by tabu search, Annals of Operations Research 41(1993)157-183.
6. T.M. Chang and Y. Yih, Determining the number of kanbans and lotsizes in a generic kanban system: A simulated annealing approach, Working Paper No. 93-3, School of Industrial Engineering, Purdue University, 1993.
7. T.M. Chang and Y. Yih, Generic kanban systems for dynamic environments, International Journal of Production Research 31(1993).
8. R.L. Daniels and J.B. Mazzola, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Annals of Operations Research 41(1993)207-230.
9. M. Dell'Amico and M. Trubian, Applying tabu search to the job-shop scheduling problem, Annals of Operations Research 41(1993)231-252.
10. B.J. Finch and J.F. Cox, An examination of just-in-time management for the small manufacturer: With an illustration, International Journal of Production Research 24(1986)329-342.
11. F. Glover, Heuristics for integer programming using surrogate constraints, Decision Sciences 8 (1977)156-166.
12. F. Glover, Tabu search: A tutorial, Interfaces 20(1990)74-94.
13. F. Glover and M. Laguna, Tabu search, in: Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, ed., Blackwell Scientific Publications, Oxford, 1993, pp. 70-150
14. W.R. Hall, Driving the Productivity Machine: Production Planning and Control in Japan, American Production and Inventory Control Society, Falls Church, VA, 1981.
15. P.Y. Huang, L.P. Rees and B.W. Taylor, A simulation analysis of the Japanese JIT techniques (with Kanban) for multi-line, multi-stage production systems, Decision Sciences 14(1983)326-344.
16. R.L. Keeney and H. Raiffa, Decisions with Multiple Objectives: Preferences and Value Tradeoffs, Wiley, New York, 1976.
17. L.J. Krajewski, B.E. King, L.P. Ritzman and D.S. Wong, Kanban, MRP, and shaping the manufacturing environment, Management Science 33(1987)39-57.
18. Y Monden, What makes the Toyota production system really tick?, Industrial Engineering 13(1981) 36-46.
19. Y. Monden, Toyota Production System: Practical Approach to Production Management, Industrial Engineering and Management Press, Atlanta, GA, 1983.
20. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA Journal on Computation 2(1990)33-45.
21. M.L. Spearman, D.L. Woodruff and W.J. Hopp, CONWIP: A pull alternative to kanban, International Journal of Production Research 28(1990)879-894.
22. E. Taillard, Some efficient heuristic methods for the flow show sequencing problem, European Journal of Operational Research 47(1990)65-74.
23. M. Widmer and A. Hertz, A new heuristic method for the flow shop sequencing problem, European Journal of Operational Research 41(1989)186-193.