论文信息 - Evolutionary algorithms for scheduling m-machine flow shop with lot streaming - 字舞流文

Evolutionary algorithms for scheduling m-machine flow shop with lot streaming

N. Jawahar | S. G. Ponnambalam | S. Marimuthu | S. Ponnambalam | S. Marimuthu | N. Jawahar

[1] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[2] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3] Chris N. Potts,et al. Flow shop scheduling with lot streaming , 1989 .

[4] David K. Smith,et al. The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[5] Chris N. Potts,et al. Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[6] Chris N. Potts,et al. Lot streaming in three-stage production processes , 1994 .

[7] R. Vickson. Optimal lot streaming for multiple products in a two-machine flow shop , 1995 .

[8] Kenneth R. Baker,et al. Lot streaming in the two-machine flow shop with setup times , 1995, Ann. Oper. Res..

[9] Hideo Tanaka,et al. Genetic algorithms for flowshop scheduling problems , 1996 .

[10] C. Sriskandarajah,et al. Lot streaming and scheduling multiple products in two-machine no-wait flowshops , 1999 .

[11] T. P. Bagchi,et al. Lot streaming and scheduling heuristics for m -machine no-wait flowshops , 2000 .

[12] S. C. Liu. A heuristic method for discrete lot streaming with variable sublots in a flow shop , 2003 .

[13] Chelliah Sriskandarajah,et al. Scheduling and Lot Streaming in Flowshops with No-Wait in Process , 2003, J. Sched..