Penjadwalan Mesin dengan Adanya Zona Terlarang
DAFTAR PUSTAKA
Abdekhodaee, A. and Ernst, A.T. (2004). Scheduling jobs with forbidden zones
in the context of coal supply chain, Proceeding of European Operations
Management Association 2004 Operations Management as a Change Event,
INSEAD, pp. 669-676.
Brucker, P. (2007). Scheduling algorithms, Springer, fifth edition, Berlin, German.
Billaut, J.C. and Sourd, F. (2001). Single machine scheduling with forbidden start
times, Université Pierre et Marie Curie, Vol.17, pp.307-329.
Chaudhuri, S. (1995). Introduction to the scheduling problem, IEEE Design &
Test of Computers, Vol. 5, pp.60-69.
Chekuri, C. and Moseley, B. (2009). Online scheduling to minimize the maximum
delay factor, SIAM, pp.1116-1125.
Feitelson, D.G. and Mu’alem, A.W. (2004). On the Definition of ”On-line” in job
scheduling problems, ACM SIGACT News, Vol.36, No.1.
Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinooy Kan, A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling, In
Annals of Discrete Mathematics 5, pp.287-326.
Jiang, Y. and He, Y. (2005). Preemptive online algorithms for scheduling with
machine cost, Acta Informatica, Vol.14, pp.315-340.
Khammuang, K., Abdekhodaee, A. and Wirth, A. (2007). ”On-line scheduling with
forbidden zones,” Journal of Operational Research Society, Vol.58, pp.80-90.
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. (1993). Sequencing and scheduling: algorithms and complexity, Handbook in Operations
Reseacrh and Management Science, Vol.4.
Legrand, A. (2004). Introduction to scheduling theory, Handbook Laboratorie Informatique et Distribution, CNRS, France.
Megow, N. and Schulz, A.S. (2004). On-line scheduling to minimize average completion time revisited, Operations Research Letter Vol.32, pp.485-490.
Megow, N., Uetz, M. and Vredeveld, T. (2006). Models and algorithms for stochastic online scheduling, Math. Operational Research Vol.31, pp.513-525.
Yamada, T. (2007). Studies on metaheuristics for jobshop and flowshop scheduling
problems. PhD Thesis, Kyoto University, Kyoto, Japan.
Universitas Sumatera Utara
41
Abdekhodaee, A. and Ernst, A.T. (2004). Scheduling jobs with forbidden zones
in the context of coal supply chain, Proceeding of European Operations
Management Association 2004 Operations Management as a Change Event,
INSEAD, pp. 669-676.
Brucker, P. (2007). Scheduling algorithms, Springer, fifth edition, Berlin, German.
Billaut, J.C. and Sourd, F. (2001). Single machine scheduling with forbidden start
times, Université Pierre et Marie Curie, Vol.17, pp.307-329.
Chaudhuri, S. (1995). Introduction to the scheduling problem, IEEE Design &
Test of Computers, Vol. 5, pp.60-69.
Chekuri, C. and Moseley, B. (2009). Online scheduling to minimize the maximum
delay factor, SIAM, pp.1116-1125.
Feitelson, D.G. and Mu’alem, A.W. (2004). On the Definition of ”On-line” in job
scheduling problems, ACM SIGACT News, Vol.36, No.1.
Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinooy Kan, A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling, In
Annals of Discrete Mathematics 5, pp.287-326.
Jiang, Y. and He, Y. (2005). Preemptive online algorithms for scheduling with
machine cost, Acta Informatica, Vol.14, pp.315-340.
Khammuang, K., Abdekhodaee, A. and Wirth, A. (2007). ”On-line scheduling with
forbidden zones,” Journal of Operational Research Society, Vol.58, pp.80-90.
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. (1993). Sequencing and scheduling: algorithms and complexity, Handbook in Operations
Reseacrh and Management Science, Vol.4.
Legrand, A. (2004). Introduction to scheduling theory, Handbook Laboratorie Informatique et Distribution, CNRS, France.
Megow, N. and Schulz, A.S. (2004). On-line scheduling to minimize average completion time revisited, Operations Research Letter Vol.32, pp.485-490.
Megow, N., Uetz, M. and Vredeveld, T. (2006). Models and algorithms for stochastic online scheduling, Math. Operational Research Vol.31, pp.513-525.
Yamada, T. (2007). Studies on metaheuristics for jobshop and flowshop scheduling
problems. PhD Thesis, Kyoto University, Kyoto, Japan.
Universitas Sumatera Utara
41