1 |
Bender, M.A., Muthukrishnan, S., and Rajaraman, R., Approximation algorithms for average stretch scheduling. Journal of Scheduling, 2004, Vol. 7, p 195-222.
DOI
|
2 |
Buscher, U. and Shen, L., An integrated Tabu search algorithm for the lot streaming problem in job-shops. European Journal of Operational Research, 2009, Vol. 199, No. 1, p 385-399.
|
3 |
Chan, W.-T., Lan, T.-W., Liu, K.-S., and Wong, P.W.H. New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. Theoretical Computer Science, 2006, Vol. 359, p 430-439.
DOI
|
4 |
Chang, J.H. and Chiu, H.N., A comprehensive review of lot streaming. International Journal of Production Research, 2005, Vol. 43, No. 8, p 1515-1536.
DOI
ScienceOn
|
5 |
Cheng, M., Mukherjee, H.J., and Sarin, S.C., A review of lot streaming. International Journal of Production Research, 2013, Vol. 51, No. 23-24, p 7023-7046.
DOI
|
6 |
Defersha, F.M. and Chen, M., Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time. International Journal of Production Research, 2012, Vol. 8, No. 15, p 2331- 2352.
|
7 |
Dreo, J., Petrowski, A., Siarry, P., and Taillard, E., Metaheuristics for Hard Optimization : Methods and Case Studies. New York, Springer, 2005.
|
8 |
Goldberg, D.E. Genetic algorithms in search, optimization, and machine learning. New York, Addison-Wesley, 1989.
|
9 |
Hall, N.G., Laporte, G., Selvarajah, E., and Sriskandrajah, C., Scheduling and lot streaming in two-machine open shops with no-wait in process. Naval Research Logistics, 2005, Vol. 52, p 261-275.
DOI
|
10 |
Kalir, A.A. and Sarin, S.C., Evaluation of the potential benefits of lot streaming in flow-shop systems. International Journal of Production Economics, 2000, Vol. 66, No. 2, p 131-142.
DOI
|
11 |
Liepins, G.E. and Hilliard, M.R., Genetic algorithms : Foundation and applications. Annals of Operations Research, 1989, Vol. 21, No. 1-4, p 31-58.
DOI
|
12 |
Low, C., Hsu, C.-M., and Huang, K.-I., Benefits of lot splitting in job-shop scheduling. International Journal of Advanced Manufacturing Technology, 2004, Vol. 24, p 773-780.
|
13 |
Marimuthu, S., Ponnambalam, S.G., and Jawahar, N., Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated Manufacturing, 2008, Vol. 24, No. 1, p 125-139.
DOI
|
14 |
Muthukrishnan, S., Rajaraman, R., Shaheen, A., and Gehrke, J.F., Online scheduling to minimize average stretch. Siam Journal on Computing, 2005, Vol. 34, No. 2, p 433-452.
DOI
|
15 |
Pan, Q.-K., Tasgetiren, M.F., Suganthan, P.N., and Chua T.J., A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 2011, Vol. 183, p 2455-2468.
|
16 |
Pinedo, M.L., Scheduling : Theory, Algorithms, and Systems (4th Ed.). New York, Springer, 2012.
|
17 |
Tseng, C.-T. and Liao, C.-J., A discrete particle swarm optimization for lot-streaming flow-shop scheduling problem. European Journal of Operational Research, 2008, Vol. 191, No. 1, p 360-373.
DOI
ScienceOn
|
18 |
Zhang, W., Yin, C., Liu, J., and Linn, R.J., Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops. International Journal of Production Economics, 2005, Vol. 96, p 189-200.
DOI
|