A heuristic method for multi-product variable lot streaming in a flow shop

Journal of the Chinese Institute of Industrial Engineers

Volumn 23, Issue 1, 2006, Pages 65-79

  Liu, Shu Chu ^a   Chen, En Chang ^a   Liu, H T ^b  

^a NATIONAL PINGTUNG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b I SHOU UNIVERSITY   (Taiwan)

Author keywords

Heuristic method; Hybrid heuristic; Multi product variable lot streaming (MPVLS); NP problem; Simulated annealing; Tabu search

Indexed keywords

COMPUTER SIMULATION; INFORMATION RETRIEVAL; PROBLEM SOLVING; PRODUCT DEVELOPMENT; SIMULATED ANNEALING;

HYBRID HEURISTIC; MULTI-PRODUCT VARIABLE LOT STREAMING (MPVLS); NP PROBLEM; TABU SEARCH;

HEURISTIC METHODS;

EID: 31544466208     PISSN: 10170669     EISSN: 21517606     Source Type: Journal    
DOI: 10.1080/10170660609508997     Document Type: Article

References (21)

1. Aarts, E. H. L., and Korst, J., 1989. Simulated Annealing and Boltzmann Machines John Wiley & Sons Publishers.
2. Aldaihani, M., and Dessouky, M. M., 2003. Hybrid scheduling methods for paratransit operations. Computers and Industrial Engineering, 45:75–96.
3. Baker, K. R., and Jia, D., 1993. A comparative study of lot streaming procedure. Omega, 21:561–566.
4. El-Najdawi, M. K., 1994. Job-splitting heuristic for lot-size scheduling in multi-product production processes. European Journal of Operational Research, 75:365–377.
5. Glover, F., and Laguna, M., 1997. Tabu Search Kluwer Academic Publishers.
6. Glover, F., 1977. A statistical approach to the TSP. Networks, 7:205–229.
7. Greistorfer, P., 2003. A tabu scatter search metaheuristic for the arc routing problem. Computers and Industrial Engineering, 44:249–266.
8. Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P., 1983. Optimization by simulated annealing. Science, 220:167–175.
9. Kalir, A. A., and Sarin, S. C., 2000. Evaluation of the potential benefits of lot streaming in flow-shop systems. International Journal of Production Economics, 66:31–142.
10. Kumar, S., Bagchi, T. P., and Sriskandarajah, C., 2000. Lot streaming and scheduling heuristics for m-machine no wait flowshop. Computers and Industrial Engineering, 38:49–172.
11. Liu, S. C., 2003. A heuristic method for discrete lot streaming with variable sublots in a flow shop. International Journal of Advanced Manufacturing Technology, 22:662–668.
12. Liu, S. C., and Chen, E. C., 2003. A variable lot streaming for multiple products Shanghai, China:The 7th International Conference of Decision Sciences Institute.
13. Liu, S. C., and Liu, T. S., 2003. A model structure and solution procedures for variable sublots of a single product. Journal of Chinese Institute of Industrial Engineers, 20:553–564.
14. Méndez, C. A., Henning, G. P., and Cerdá, J., 2000. Optimal scheduling of batch plants satisfying multiple product orders with different due-dates. Computers and Chemical Engineering, 24:2223–2245.
15. Reeves, C. R., 1995. Modern Heuristic Techniques for Combinatorial Problems McGraw Hill.
16. Rajendran, C., 1995. Heuristics for scheduling in flowshop with multiple objectives. European Journal of Operational Research, 82:540–555.
17. Ramasesh, R. V., Fu, H., Fong, D. K. H., and Hayya, J. C., 2000. Lot streaming in multistage production system. International Journal of Production Economics, 66:199–211.
18. Skiscim, C. C., and Golden, B. L., 1983. “ Optimization by simulated annealing:a preliminary computational study for the TSP,”. In Proceedings of the 1983 Winter Simulation Conference Washington, D. C.
19. Sriskandarajah, C., and Wangeur, E., 1999. Lot streaming and scheduling multiple products in two-machine no-wait flowshops. IIE Transactions, 31:695–707.
20. Trietsch, D., and Baker, K. R., 1993. Basic techniques for lot streaming. Operations Research, 41:1065–1076.
21. Tian, P. M. J., and Zhang, D. M., 1999. Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property:an investigation of generation mechanism. European Journal of Operational Research, 118:81–94.