|
1.Ahuja, R.K., T.L. Magnanti and J.B.Orlin (1993), Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, New Jersey). 2.Ahuja, R.K., and J.B. Orlin (1989), A fast and simple algorithm for the maximum flow problem, Operations Research 37 (5), 748-759. 3.Blazewicz, J., M. Drozdowski, P. Formanowicz, W. Kubiak, and G. Schmidt (2000), Scheduling preemptable tasks on parallel processors with limited availability, Parallel Computing 26, 1195-1211. 4.Blazewicz, J., K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz (2001), Scheduling Computer and Manufacturing Processes (Springer, Berlin). 5.Blazewicz, J., K. Ecker, G. Schmidt, and J. Weglarz (1993), Scheduling in Computer and Manufacturing Systems (Springer, Berlin). 6.Centeno, G., and R.L Armacost (1997), Parallel machine scheduling with release time and machine eligibility restrictions, Computers & Industrial Engineering 33(1-2), 273-276. 7.Centeno, G., and R.L. Armacost (2004), Minimizing makespan on parallel machines with release time and machine eligibility restrictions, International Journal of Production Research 42(6), 1243-1256. 8.Dantzig, G. B., and D. R. Fulkerson (1956), On the max-flow min-cut theorem of networks, in: H. W. Kuhn, A. W. Tucker (eds.), Liner Inequalities and Related Systems, Annals of Mathematics Study 38 (Princeton University Press, Princeton, New York) 215-221. 9.Ford, L.R., and D.R. Fulkerson (1956), Maximal flow through a network, Canadian Journal of Mathematics 8, 399-404. 10.Fulkerson, D.R., and G.B. Dantzig (1955), Computations of maximum flow in networks, Naval Research Logistics Quarterly Quart 2, 277-283. 11.Gharbi, A., and M. Haouari (2005), Optimal parallel machines scheduling with availability constraints, Discrete Applied Mathematics 148, 63-87 12.Graham, R.L., E.L. Lawer, J.K. Lenstra, and A.H.G. Rinnooy Ken (1979), Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics 5, 287-326. 13.Horn, W.A. (1974), Some simple scheduling algorithms, Naval Research Logistics Quarterly 21, 177-185. 14.Hwang, H.C., and S.Y. Chang (1998), Parallel machines scheduling with machine shutdowns, Computers & Mathematics with Applications 36(3), 21-31. 15.Hwang, H.C., S.Y. Chang, and K. Lee (2004), Parallel machine scheduling under a grade of service provision, Computer & Operations Research 31, 2055-2061. 16.Hwang, H.C., K. Lee, and S.Y. Chang (2005), The effect of machine availability on the worst-case performance of LPT, Discrete Applied Mathematics 148, 49-61. 17.Kellerer, H. (1998), Algorithm for multiprocessor scheduling with machine release time, IIE Transactions 30, 991-999. 18.Lawer, E.L. (1976), Combinational Optimization: Networks and Matroids (Holt, Rinehart & Winston, New York). 19.Labetoulle, J., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnoy Kan (1984), Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (eds.), Progress in Combinatorial Optimization (Academic Press, New York) 245-261. 20.Lee, C.Y. (1991), Parallel machines scheduling with nonsimultaneous machine available time, Discrete Applied Mathematics 30, 53-61. 21.Lee, C.Y. (1996), Machine scheduling with an availability constraint, Journal of Global Optimization 9, 395-416. 22.Lee, C.Y., L. Lei, and M. Pinedo (1997), Current trends in deterministic scheduling, Annals of Operations Research 70, 1-41. 23.Lee, C.Y., Y. He, and G. Tang (2000), A note on “parallel machine scheduling with non-simultaneous machine available time”, Discrete Applied Mathematics 100, 133-135. 24.Liao, C.J., D.L. Shyur, and C.H. Lin (2005), Makespan minimization for two parallel machines with an availability constraint, European Journal of Operational Research 160, 445-456. 25.Lin, G..H., E.Y. Yao, and Y. He (1998), Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times, Operations Research Letters 22, 75-81. 26.Liu, Z., and E. Sanlaville (1995), Profile scheduling of list algorithm, in: P. Chretienne et al. (eds.), Scheduling Theory and its Applications (Wiley, New York) 91-110. 27.Lin, Y., and W. Li (2004), Parallel machine scheduling of machine-dependent jobs with unit-length, European Journal of Operational Research 156, 261-266. 28.Pinedo, M. (2002), Scheduling: Theory, Algorithm and System (New Jersey, Prentice Hall). 29.Sanlaville, E. (1995), Nearly on line scheduling of preemptive independent tasks, Discrete Applied Mathematics 57, 229-241. 30.Sanlaville, E., and G. Schmidt (1998), Machine scheduling with availability constraints, Acta Informatica 35, 795-811. 31.Schmidt, G. (1984), Scheduling on semi-identical processors, Zeitschrift für Operations Research A28, 153-162. 32.Schmidt, G. (1988), Scheduling independent tasks with deadlines on semi-identical processors, Journal of the Operational Research Society 39, 271-277. 33.Schmidt, G. (2000), Scheduling with limited machine availability, European Journal of Operational Research 121, 1-15. 34.Takao, A., and A. Yasuhito (2000), Recent developments in maximum flow algorithms, Journal of the Operations Research Society of Japan 43(1), 2-31.
|