References
- Adiri, I. and N. Amit, 'Openshop and flowshop scheduling to minimize sum of completion times,' Computers and Operations Research 11 (1984), 275-284 https://doi.org/10.1016/0305-0548(84)90016-9
- Allahverdi, A., 'Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness,' Computers and Operations Research 23 (1996), 909-916 https://doi.org/10.1016/0305-0548(96)00012-3
- Cheng, T. C. E. and N. Shakhlevich, 'Proportionate flow shop with controllable processing times,' Journal of Scheduling 2 (1999), 253-265 https://doi.org/10.1002/(SICI)1099-1425(199911/12)2:6<253::AID-JOS30>3.0.CO;2-R
- Choi, B.-C., S.-H. Yoon, and S.-J. Chung, 'Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds,' International Journal of Production Research 44 (2006), 715-728 https://doi.org/10.1080/00207540500268780
- Conway, R. W., Maxwell, W. L., and Miller, L. W., Theory of scheduling, Addision-Wesley, Reading, MA, 1967
- Croce, F. D., M. Ghirardi, and R. Tadei, 'An improved branch-and-bound algorithm for the two machine total completion time flow shop problem,' European Journal of Operational Research 139, (2002), 293-301 https://doi.org/10.1016/S0377-2217(01)00374-5
- Croce, F. D., V. Narayan, and R. Tadei, 'The two-machine total completion time flow shop problem,' European Journal of Operational Research 90 (1996), 227-237 https://doi.org/10.1016/0377-2217(95)00351-7
- Garey, M. R, D. S. Johnson, and R. Sethi, 'The complexity of flowshop and jobshop scheduling,' Mathematics of Operations Research 1 (1976), 117-129 https://doi.org/10.1287/moor.1.2.117
- Gonzalez, T. and S. Sahni, 'Flowshop and job shop schedules: Complexity and approximation,' Operations Research 26 (1978), 36-52 https://doi.org/10.1287/opre.26.1.36
- Graham, R L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, 'Optimization and approximation in deterministic sequencing and scheduling: A survey,' Annals of Discrete Mathematics 5 (1979), 287-326 https://doi.org/10.1016/S0167-5060(08)70356-X
- Hoogeveen, J. A. and T. Kawaguchi, 'Minimizing total completion time in a two-machine flowshop: analysis of special cases,' Mathematics of Operations Research 24 (1999), 887-910 https://doi.org/10.1287/moor.24.4.887
- Hou, S. X. and H. Hoogeveen, 'The three-machine proportionate flow shop problem with unequal machine speeds,' Operations Research Letters 31 (2003), 225-231 https://doi.org/10.1016/S0167-6377(02)00232-8
- Lee, W.-C. and C.-C. Wu, 'Minimizing the total flow time and tardiness in a two-machine flow shop,' International Journal of Systems Science 32 (2001), 365-373 https://doi.org/10.1080/002077201300029746
- Ow, P. S., 'Focused scheduling in proportionate flowshops,' Management Science 31 (1985), 852-869 https://doi.org/10.1287/mnsc.31.7.852
- Shakhlevich, N., H. Hoogeveen, and M. Pinedo, 'Minimizing total weighted completion time in a proportionate flow shop,' Journal of Scheduling 1 (1998), 157-168 https://doi.org/10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y
- Sipper, D. and R Shapira, 'JIT Vs. WIP-a trade-off analysis,' International Journal of Production Research 27 (1989), 903-914 https://doi.org/10.1080/00207548908942597
- van de Velde, S. L., 'Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation,' Annals of Operations Research 26 (1992), 257-268
- Vollman, T. E., W. L. Berry, and D. C. Whybark, Manufactuting planning and control systems, McGraw-Hill, New York, NY, 1997
-
Wang, C., C. Chu, and J.-M. Proth, 'Efficient heuristic and optimal approaches for n / 2 / F /
${\Sigma}C_i$ scheduling problems,' International Journal of Production Economics 44 (1997), 225-237 https://doi.org/10.1016/0925-5273(96)00060-6 - Yang, J., 'Two machine flow shop scheduling problem with weighted WIP weight,' Computers and Operations Research 36 (2009), 472-486 https://doi.org/10.1016/j.cor.2007.09.014
- Yang, J. and M. E. Posner, 'Flow Shops with WIP and Value Added Costs,' Journal of Scheduling (2009), in press