DUAL HYBRID ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM

Vu Dinh Hoa, Do Tuan Hanh, Nguyen Huu Mui

Abstract



Keywords


Scheduling, Schedule, Genetic Algorithm.

Full Text:

PDF

References


S.B. Akers and J. Friedman, A non-numerical approach to production scheduling problems, Operatons Research 3 (1955), 429-442.

S.B. Akers, A graphical approach to production scheduling problems, Operations Research 4 (1956), 244.

S. A. Kravchenko and Y. N. Sotskov, Optimal makespan schedule for three jobs on two machines, ZOR - Mathematical Methods of Operations Research 43 (1996), 233-238.

P. Brucker, A polynomial time algorithm for the two machines Job Shop scheduling problem with a fixed number of jobs, OR Spektrum 16 (1994), 5-7.

Y.N. Sotskov and N. V. Shaklevich, NP-hardness of shop-scheduling problems with three jobs, Descrete Applied Mathemayics 59 (1995), 237-266.

C. Fischer and G. L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules. In Industrial Scheduling, pp. 225-251, Englewood Cli_s, N.J., 1963. Prentice-Hall.

J. F. Muth and G. L. Thompson, Industrial Scheduling, Prentice-Hall, Englewood Cli_s, N. J., 1963.

G. H. Brooks and C. R. White, An algorithm for finding optimal or near optimal solutions to the production scheduling problem, The Journal of Industrial Engineering, Vol. 16, No. 1, pp. 34-40, 1969.

J. Carlier and E. Pinson, An algorithm for solving the job-shop problem, Management Science, Vol. 35, No. 2, pp. 164-176, 1989.

J. H. Holland (1975), Adaptation in Natural and Artificial Systems. Unuv. of Michigan Press, 1975.

R. Nakano and T. Yamada, Conventional genetic algorithm for job shop problems, In Proceedings of International Conference on Genetic Algorithms (ICGA ’91), pp. 474-479, 1991.

Takeshi YAMADA, Studies on Metaheuristics for Jobshop and Flowshop Scheduling Problems, YOTO UNIVERSITY KYOTO, JAPAN November,pp 42-70 2003.

Nguyá»…n Hữu Mùi, VÅ© Äình Hoà (2011), "Má»™t thuật toán di truyá»n lai má»›i cho bà i toán lập lịch công việc", Ká»· yếu há»™i nghị khoa há»c công nghệ quốc gia lần thứ V, tr. 239-249.

M. Kebabla, L. H. Mouss, A local search genetic algorithm for the job shop scheduling problem, Revue des Sciences et de la Technologie – RST, Volume 3 N°1 / janvier 2012.

Adams, J., E. Balas, and D. Zawack. "The Shifting Bottleneck Procedure for Job Shop

Scheduling", Management Science, vol.34 (1988), pp. 391–401.

Günter Rudolph, Convergence Analysis of Canonical Genetic Algorithms, IEEE Transactions on Neural Networks, special issue on evolutonary computation, Vol. 5, No. 1, 1994.


Refbacks

  • There are currently no refbacks.


ISSN: 1694-2507 (Print)

ISSN: 1694-2108 (Online)