參考文獻 |
[1]Azizoglu, M., S. Webster. 2001. Scheduling a batch processing machine with incompatible job families. Computers &Industrial Engineering 39 325-335.
[2]Blazewicz, J., M. Drozdowski, P. Formanowicz, W. Kubiak, G.. Schmidt. 2000. Scheduling preemptable tasks on parallel processors with limited availability. Parallel Computing 26 1195-1211.
[3]Blazewicz, J., P. Dell’Olmo, M. Drozdowski, P. Maczka. 2003. Scheduling multiprocessor tasks on parallel processors with limited availability. European Journal of Operational Research 149 377-389.
[4]Bodlaender, H.L., K. Jansen, and G..J. Woeginger. 1994. Scheduling with incompatible jobs. Discrete Applied Mathematics 55 219-232.
[5]Centeno, G., R.L. Armacost. 1997. Parallel machine scheduling with release time and machine eligibility restrictions. Computers & Industrial Engineering 33(1-2) 273-276.
[6]Centeno, G., 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.
[7]De Reyck, B, W. Herroelen. 1998. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 111 152-174.
[8]Horn, W.A. 1974. Some simple scheduling algorithms. Naval Research Logistics Quarterly 21 177-185.
[9]Hwang, H.C., S.Y. Chang. 1998. Parallel machines scheduling with machine shutdowns. Computers & Mathematics with Applications 36(3) 21-31.
[10]Hwang, H.C., S.Y. Chang, K. Lee. 2004. Parallel machine scheduling under a grade of service provision. Computers & Operation Research 31 2055-2061.
[11]Hwang, H.C., S.Y. Chang, Y. Hong. 2004. A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints. Asia - Pacific Journal of Operational Research 21(1) 117-125.
[12]Jansen, K. 2003. Approximate strong separation with application in fractional graph coloring and preemptive scheduling. Theoretical Computer Science 302 239-256.
[13]Lee, C.Y. 1991. Parallel machines scheduling with nonsimultaneous machine available time. Discrete Applied Mathematics 30 53-61.
[14]Lee, C.Y. 1996. Machine scheduling with an availability constraint. Journal of Global Optimization 9 395-416.
[15]Lee, C.Y., Y. He, G. Tang. 2000. A note on parallel machine scheduling with non-simultaneous machine available time. Discrete Applied Mathematics 100 133-135.
[16]Liao, L.W., G. J. Sheen. 2007. Parallel machine scheduling with machine availability and eligibility constraints. European Journal Operation Research. Article in press.
[17]Lin, C. F. 2006. Branch and bound algorithm for parallel machine scheduling with availability and eligibility constraints. Unpublished Master Thesis, Institute of Industrial Management, National Central University.
[18]Lin, Y., W. Li. 2004. Parallel machine scheduling of machine-dependent jobs with unit-length. European Journal of Operational Research 156 261-266.
[19]Lu, B. H. 2005. Parallel machine scheduling with machine availability and eligibility constraints. Unpublished Master Thesis, Institute of Industrial Management, National Central University.
[20]Pinedo, M. 2002. Scheduling: Theory, Algorithm and System (2th ed.). Englewood Cliffs, NJ: Prentice-Hall.
[21]Schmidt, G.. 1988. Scheduling independent tasks with deadlines on semi-identical processors. Journal of the Operational Research Society 39 271-277.
[22]Schmidt, G.. 2000. Scheduling with limited machine availability. European Journal of Operational Research 121 1-15.
[23]Sanlaville, E. 1995. Nearly online scheduling of preemptive independent tasks. Discrete Applied Mathematics 57 29-241.
[24]Sheen, G. J., L.W. Liao. 2007. Scheduling machine-dependent jobs to minimize lateness on identical machines with availability constraints. Computers & Operations Research 34 2266-2278.
[25]Ullman, J.D. 1975. NP-complete scheduling problems. Journal of Computer and System Sciences 10 384-393.
[26]Wang, C.S., R. Uzsoy. 2002. A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers &Operations Research 29 1621-1640.
[27]Webster, S., K.R. Baker. 1995. Scheduling groups of jobs on a single machine. Operation Research 43 692-703. |