|
[1]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. [2]Blazewicz, J., P. Dell’Olmo, M. Drozdowski, and P. Maczka (2003), “Scheduling multiprocessor tasks on parallel processors with limited availability,” European Journal of Operational Research, 149, 377-389. [3]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. [4]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. [5]Ecker, K., G. Schmidt, J. Weglarz, and J. Blazewicz (1994), Scheduling in Computer and Manufacturing Systems (2th ed.), Springer-Verlag, Berlin. [6]Federgruen, A., and H. Groenevelt (1986), “Preemptive scheduling of uniform machined by ordinary network flow techniques,” Management Science, 32(3), 341-349. [7]Hwang, H.C., and S.Y. Chang (1998), “Parallel machines scheduling with machine shutdowns,” Computers & Mathematics with Applications, 36(3), 21-31. [8]Hwang, H.C., S.Y. Chang, and K. Lee (2004), “Parallel machine scheduling under a grade of service provision,” Computers & Operation Research, 31, 2055-2061. [9]Kellerer, H. (1998), “Algorithm for multiprocessor scheduling with machine release time,” IIE Transactions, 30, 991-999. [10]Lee, C.Y. (1991), “Parallel machines scheduling with nonsimultaneous machine available time,” Discrete Applied Mathematics, 30, 53-61. [11]Lee, C.Y. (1996), “Machine scheduling with an availability constraint,” Journal of Global Optimization, 9, 395-416. [12]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. [13]Lin, Y., and W. Li (2004), “Parallel machine scheduling of machine-dependent jobs with unit-length,” European Journal of Operational Research, 156, 261-266. [14]Liu, Z., and E. Sanlaville (1995), “Preemptive scheduling with variable profile, precedence constraints and due dates,” Discrete Applied Mathematics, 58, 253-280. [15]Liu, Z., and E. Sanlaville (1994), Profile scheduling of list algorithm, In: Chretienne, P. et al. (Eds.), Scheduling Theory and its Applications, NY: Wiley, p.91-110. [16]Pinedo, M. (2002), Scheduling: Theory, Algorithm and System (2th ed.), Prentice Hall, Englewood Cliffs, NJ. [17]Sanlaville, E. (1995), “Nearly online scheduling of preemptive independent tasks,” Discrete Applied Mathematics, 57, 229-241. [18]Schmidt, G. (1988), “Scheduling independent tasks with deadlines on semi-identical processors,” Journal of the Operational Research Society, 39, 271-277. [19]Schmidt, G. (2000), “Scheduling with limited machine availability,” European Journal of Operational Research, 121, 1-15. [20]Ullman, J.D. (1975), “NP-complete scheduling problems,” Journal of Computer and System Sciences, 10, 384-393.
|