References
- Bender, M. A., Muthukrishnan, S., and Rajaraman, R., "Approximation algorithms for average stretch scheduling," Journal of Scheduling, Vol. 7, pp. 195-222, 2004. https://doi.org/10.1023/B:JOSH.0000019681.52701.8b
- Bhattacharyya, S., "Direct marketing performance modeling using genetic algorithms," INFORMS Journal on Computing, Vol. 11, pp. 248-257, 1999. https://doi.org/10.1287/ijoc.11.3.248
- 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, Vol. 359, pp. 430-439, 2006. https://doi.org/10.1016/j.tcs.2006.06.003
- Chang, J. H. and Chiu, H. N., "A comprehensive review of lot streaming," International Journal of Production Research, Vol. 43, No. 8, pp. 1515-1536, 2005. https://doi.org/10.1080/00207540412331325396
- Cheng, M., Mukherjee, H. J., and Sarin, S. C., "A review of lot streaming," International Journal of Production Research, Vol. 51, No. 23-24, pp. 7023-7046, 2013. https://doi.org/10.1080/00207543.2013.774506
- Chiu, H.-N., Chang, J.-H., and Lee, C.-H., "Lot streaming models with a limited number of capacitated transporters in multistage batch production system," Computers and Operations Research, Vol. 31, pp. 2003-2020, 2004. https://doi.org/10.1016/S0305-0548(03)00159-X
- Dreo, J., Petrowski, A., Siarry, P., and Taillard, E., Metaheuristics for Hard Optimization : Methods and Case Studies. Springer, New York, 2005.
- Edis, R. S. and Ornek, M. A., "A tabu search-based heuristic for single-product lot streaming problems in flow shops," International Journal of Advanced Manufacturing Technology, Vol. 43, pp. 1202-1213, 2009. https://doi.org/10.1007/s00170-008-1798-5
- Feldmannn, M. and Biskup, D., "Lot streaming in a multiple product permutation flow shop with intermingling," International Journal of Production Research, Vol. 46, No. 1, pp. 197-216, 2008. https://doi.org/10.1080/00207540600930065
- Goldberg, D. E., Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, New York, 1989.
- Liepins, G. E. and Hilliard, M. R., "Genetic algorithms : Foundation and applications," Annals of Operations Research, Vol. 21, No. 1-4, pp. 31-58, 1989. https://doi.org/10.1007/BF02022092
- Muthukrishnan, S., Rajaraman, R., Shaheen, A., and Gehrke, J. F., "Online scheduling to minimize average stretch," Siam Journal on Computing, Vol. 34, No. 2, pp. 433-452, 2005. https://doi.org/10.1137/S0097539701387544
- Pan, Q.-K., Suganthan, P. N., Liang, J. J., and Tasgetiren, M. F., "A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming lfow shop scheduling problem," Expert Systems with Applications, Vol. 38, pp. 3252-3259, 2011. https://doi.org/10.1016/j.eswa.2010.08.111
- Pinedo, M. L., Scheduling : Theory, Algorithms, and Systems(4th Ed.), Springer, New York, 2012.
- Song, B. D. and Oh, Y., "A study on network redesign for supply chain expansion," The Journal of Society for e-Business Studies, Vol. 17, No. 4, pp. 141-153, 2012. https://doi.org/10.7838/jsebs.2012.17.4.141
- Wong, T. C., Chan, F. T. S., and Chan, L. Y., "A resource-constrained assembly job shop scheduling problem with lot streaming technique," Computers and Industrial Engineering, Vol. 57, 983-995, 2009. https://doi.org/10.1016/j.cie.2009.04.002
Cited by
- 작업별 중요도 모드를 적용한 혼합 중요도 스케줄링에서 확률적 성능 평가 기법 vol.23, pp.3, 2015, https://doi.org/10.7838/jsebs.2018.23.3.001
- Lot Streaming in Different Types of Production Processes: A PRISMA Systematic Review vol.5, pp.4, 2015, https://doi.org/10.3390/designs5040067