1 |
Attar, S. F., Mohammadi, M., and Tavakkoli-Moghaddam, R., "Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times", International Journal of Advanced Manufacturing technology, Vol. 68, 2013, pp. 1583-1599.
DOI
|
2 |
Baker, K. R., Introduction to sequencing and scheduling, New York : John Wiley and Sons, 1974.
|
3 |
Bouquard, J. L. and Lente, C., "Two-machine flow shop scheduling problems with minimal and maximal delays", A Quarterly Journal of Operations Research, Vol. 4, 2006, pp. 15-28.
|
4 |
Chen, T. C. E., Gupta, J. N. D., and Wang, G., "A review of flowshop scheduling research with setup times", Production and Operations Management, Vol. 9, 2000, pp. 283-302.
|
5 |
Choi, S. W., "Heuristics for two-machine re-entrant flowshop with limited waiting times and ready times", Submitted to Korea Contents Spring Conference, May, 2015.
|
6 |
Choi, S. W. and Kim, Y. D., "Minimizing makespan on a two-machine re-entrant flow-shop", Journal of the Operational Research Society, Vol. 58, 2007, pp. 972-981.
DOI
|
7 |
Choi, S. W., Lim, T. K., and Kim, Y. D., "Heuristics for scheduling wafer lots at the deposition workstation in a fab", Journal of the Korean Institute of Industrial Engineers, Vol. 36, 2010, pp. 125-137.
|
8 |
Chu, C., "A branch and bound algorithm to minimize total tardiness with different release times", Naval Research Logistics, Vol. 39, 1992, pp. 265-283.
DOI
|
9 |
Framinan, J. M., Gupta, J. N. D., and Leisten, R., "A review and Classification of heuristics for permutation flow-shop scheduling with makespan objective", Journal of Operational Research Society, Vol. 55, 2004, pp. 1243-1255.
DOI
|
10 |
Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G., "Optimization and approximation in deterministic sequencing and scheduling : A survey", Annals of Discrete Mathematics, Vol. 5, 1979, pp. 287-326.
DOI
|
11 |
Gupta, J. N. D. and Stafford, J. E. F., "Flow-shop scheduling research after five decades", European Journal of Operational Research, Vol. 169, 2006, pp. 699-711.
DOI
|
12 |
Hall, L. A., "A polynomial approximation scheme for a constrained flow shop scheduling problem", Mathematics of Operations research, Vol. 19, 1994, pp. 68-85.
DOI
|
13 |
Johnson, S. M., "Optimal two- and three-stage production schedules with setup times included", Naval Research Logistics Quarterly, Vol. 1, 1954, pp. 61-68.
DOI
|
14 |
Joo, B. J. and Kim, Y. D., "A branch-and-bound algorithm for a two-machine flow-shop scheduling problem with limited waiting time constraints", Journal of the Operational Research Society, Vol. 60, 2009, pp. 572-582.
DOI
|
15 |
Kim, Y. D., "Heuristics for flowshop scheduling problems minimizing mean tardiness", Journal of Operational Research Society, Vol. 44, 1993, pp. 19-28.
DOI
|
16 |
Nawaz, M., Enscore, E. E., and Ham, I., "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem", Omega, Vol. 11, 1983, pp. 91-95.
DOI
|
17 |
Potts, C. N., "Analysis of heuristics for two-machine flow-shop sequencing subject to release dates", Mathematics of Operations research, Vol. 10, 1985, pp. 576-584.
DOI
|
18 |
Tadei, R., Gupta, J. N. D., Della, C. F., and Cortesi, M., "Minimizing makespan in the two-machine flow-shop with release times", Journal of Operational Research Society, Vol. 49, 1998, pp. 77-85.
DOI
|
19 |
Yang, D. L. and Chern, M. S., "A two-machine flowshop sequencing problem with limited waiting time constraints", Computers and Industrial Engineering, Vol. 28, 1995, pp. 63-70.
|