참고문헌
- Bruno, j., Coffiman, Jr., E. G., and Sethi, G.; "Scheduling independent tasks to reduce mean finishing time,ʼ Comunications of the ACM, 17(7) : 382-387, 1974. https://doi.org/10.1145/361011.361064
- Choi, S-W. and Kim, Y-D.; "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, 58(7) : 972-981, 2007. https://doi.org/10.1057/palgrave.jors.2602220
- Choi, S-W. and Kim, Y-D.; "Minimizing makespan on an m-machine re-entrant flowshop," Computers and Operations Research, 35(5) : 1684-1696, 2008. https://doi.org/10.1016/j.cor.2006.09.028
- Choi, S-W. and Kim, Y-D.; "Minimizing total tardiness on a two-machine re-entrant flowshop," Journal of the Operational Research Society, 199(2) : 375-384, 2009. https://doi.org/10.1016/j.ejor.2008.11.037
- Choi, S-W., Lim, T-K., and Kim Y-D.; "Heuristics for scheduling wafer lots at the deposition workstation in a semiconductor wafer fab," 36(2) : 125-137, 2010.
- Kim, Y-D., Kim, J-U., Lim, S-K., and Jun, H-B.; "Duedate based scheduling and control policies in a multiproduct semiconductor wafer fabrication facility," IEEE Transactions on Semiconductor Manufacturing, 11(1) : 155- 164, 1998. https://doi.org/10.1109/66.661295
- Lawler, E. L. and Moore, J. M.; "A functional equation and its application to resource allocation and sequencing problems," Management Science, 16(1) : 77-84, 1969. https://doi.org/10.1287/mnsc.16.1.77
- Lee, C. Y. and Uzsoy, R.; "A new dynamic programming algorithm for the parallel machines total weighed completion time problem," Operational Research Letters, 11 : 73-75, 1992. https://doi.org/10.1016/0167-6377(92)90035-2
- Lee, G-C.; "Scheduling methods for a hybrid flowshop with dynamic order arrival," Journal of the Korea Institute of Industrial Engineers, 32(4) : 373-381, 2006.
- Lim, S-K., Kim, J-G., and Kang, J-G.; "A collaboration system for two-stage semiconductor manufacturing supply chain," Journal of the Korea management Engineers Society, 14(2) : 11-29, 2009.
- Sung, C. S. and Choung, Y. I.; "Minimizing Makespan on a Single Burn-in Oven in Semiconductor Manufacturing," European Journal of Operational Research, 120(3) : 559- 574, 2000. https://doi.org/10.1016/S0377-2217(98)00391-9
- Thiagarajan, S. and Rajendra, C.; "Scheduling in dynamic assembly job-shops to minimizie the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs," Computers and Industrial Engineering, 49(4) : 463-503, 2005. https://doi.org/10.1016/j.cie.2005.06.005
- Webster, S.; "A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems," European Journal of Operational Research, 70(3) : 327- 334, 1993. https://doi.org/10.1016/0377-2217(93)90244-H
- Webster, S.; "A note on schedule of n jobs on two identical machines to minimize weighted mean flow time," Computers and Industrial Engineering, 26 : 795-796, 1994. https://doi.org/10.1016/0360-8352(94)90014-0
- Wein, L. M.; "Scheduling semiconductor wafer fabrication," IEEE Transactions on Semiconductor Manufacturing, 1(3) : 115-130, 1988. https://doi.org/10.1109/66.4384