Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem

International Journal of Production Research

Volumn 46, Issue 20, 2008, Pages 5719-5759

  Chang, P T ^a   Lin, K P ^a   Pai, P F ^b   Zhong, C Z ^a   Lin, C H ^a   Hung, L T ^a  

^a TUNGHAI UNIVERSITY   (Taiwan)

^b NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization; Genetic algorithms; Job shop; Multiple objectives; Order splitting; Parallel machines

Indexed keywords

ANT COLONY OPTIMIZATION; JOB-SHOP; MULTIPLE OBJECTIVES; ORDER SPLITTING; PARALLEL MACHINES;

GENETIC ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; PARALLEL ALGORITHMS; SCHEDULING; SCHEDULING ALGORITHMS;

CONSTRAINED OPTIMIZATION;

EID: 65249125899     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540600693523     Document Type: Article

References (69)

1. Allahverdi, A., A new heuristic for m-machine flowshop-scheduling problem with bicriteria of makespan and maximum tardiness. Comput. Oper. Res., 2004, 31, 157-180.
2. Allahverdi, A., The two- and m-machine flowshop-scheduling problems with bicriteria of makespan and mean flowtime. Eur. J. Oper. Res., 2003, 147, 373-396.
3. Baker, K.R., Sequence rules and due-date assignments in a job shop. Manag. Sci., 1984, 30, 1093-1104.
4. Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C. and Stewart Jr, W.R., Designing and reporting on computational experiments with heuristic methods. J. Heurist., 1995, 1, 9-32.
5. Bauer, A., Bullnheimer, B., Hartl, R.F. and Strauss, C., An ant colony optimization approach for the single machine total tardiness problem. 1999 Congress on Evolutionary Computation, pp. 1445-1450, 1999.
6. Bilge, U., Kirac, F., Kurtulan, M. and Pekgun, P., A tabu search algorithm for parallel machine total tardiness problem. Comput. Oper. Res., 2004, 31, 397-414.
7. Birman, M. and Mosheiov, G., A note on a due-date assignment on a two-machine flow-shop. Comput. Oper. Res., 2004, 31, 473-480.
8. Botee, H.M. and Bonabeau, E., Evolving ant colony optimization. Adv. Complex Sys., 1998, 1, 149-159.
9. Brah, S.A. and Hunsucker, J.L., Branch-and-bound algorithm for the flowshop with multiple processors. Eur. J. Oper. Res., 1991, 51, 88-99.
10. Bullnheimer, B., Hartl, R.F. and Strauss, C., Applying the ant system to the vehicle routing problem, in Proceedings of the 2nd International Conference on Metaheuristics, 1997.
11. Chang, P.-C., Hsieh, J.-C. and Lin, S.-G., The development of gradual-priority weighting approach for the multi-objective flowshop-scheduling problem. Int. J. Prod. Econ., 2002, 79, 171-183.
12. Chang, P.-T. and Lo, Y.-T., Modelling of job-shop scheduling with multiple quantitative and qualitative objectives and a GA/TS mixture approach. Int. J. Comput.-Integr. Manuf., 2001, 14, 367-384.
13. Cheng, R., Gen, M. and Tsujimura, Y., A tutorial survey of job-shop-scheduling problems using genetic algorithms I. Representation. Comput. Ind. Eng., 1996, 30, 983-997.
14. Cheng, T.C.E. and Diamond, J.E., Scheduling two job classes on parallel machines. IIE Trans., 1995, 27, 689-693.
15. Chou, F.D. and Lee, C.E., Two-machine flowshop scheduling with bicriteria problem. Comput. Ind. Eng., 1999, 36, 549-564.
16. Colorni, A., Dorigo, M. and Maniezzo, V., Distributed optimization by ant colonies, in First European Conference Artif. Life, edited by F. Varela and P. Bourgine, 1991, pp. 134-142 (Elsevier: Paris, France).
17. Colorni, A., Dorigo, M., Maniezzo, V. and Trubian, M., Ant system for job-shop scheduling. Belg. J. Oper. Res. Stat. Comput. Sci., 1994, 34, 39-53.
18. Daniels, R.L., Incorporating performance information into multi-objective scheduling. Eur J. Oper. Res., 1994, 77, 272-286.
19. Djellab, H. and Djellab, K., Preemptive hybrid flowshop-scheduling problem of interval orders. Eur. J. Oper. Res., 2002, 137, 37-49.
20. Dorigo, M. and Gambardella, L.M., Ant colonies for the travelling salesman problem. BioSystems, 1997a, 43, 78-81.
21. Dorigo, M. and Gambardella, L.M., Ant Colony System: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Computat., 1997b, 1, 53-66.
22. Dorigo, M. and Maria, L., Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Computat., 1997, 1, 53-66.
23. Dorigo, M. and Stützle, V., Ant Colony Optimization, 2004 (MIT Press: London).
24. Dorigo, M., Caro, G.D. and Gambarsella, L.M., Ant algorithms for discrete optimization. Artif. Life, 1999, 5, 137-172.
25. Dorigo, M., Maniezzo, V. and Colorni, A., Ant system: optimization by a colony of cooperating agents. IEEE Trans. Sys. Man Cybernet. B, 1996, 26, 29-41.
26. Dorigo, M., Maniezzo, V. and Colorni, A., Positive Feedback as a Research Strategy. Technology Report No. 91-016, 1991 (Politecnico di Milano, Milan).
27. Esquivel, S., Ferrero, S., Gallard, R., Salto, C., Alfonso, H. and Schutz, M., Enhanced evolutionary algorithms for single and multiobjective optimization in the job shopscheduling problem. Knowledge-Based Sys., 2002, 15, 13-25.
28. Framinan, J.M., Leisten, R. and Ruiz-Usano, R., Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization. Eur. J. Oper. Res., 2002, 141, 559-569.
29. Frey, D.D., Engelhardt, F. and Greitzer, E.M., A role for 'one-factor-at-a-time' experimentation in parameter design. Res. Eng. Des., 2003, 14, 65-74.
30. Gambardella, L.M. and Dorigo, M., Ant-Q: a reinforcement learning approach to the traveling salesman problem, in Proceedings of the 12th International Conference on Machine Learning, 1995, pp. 252-260.
31. Ghedjati, F., Genetic algorithms for the job-shop-scheduling problem with unrelated parallel constraints: heuristic mixing method machines and precedence. Comput. Ind. Eng., 1999, 37, 39-42.
32. Goldberg, D.E., Genetic Algorithm in Search, Optimization and Machine Learning, 1989 (Addision-Wesley: Reading, MA).
33. Gravel, M., Price, W.L. and Gagné, C., Scheduling continuous casting of aluminium using a multiple objective colony optimization metaheuristic. Eur. J. Oper. Res., 2002, 143, 218-229.
34. Gupta, J.N.D., Kruger, K., Lauff, V., Werner, F. and Sotskov, Y.N., Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput. Oper. Res., 2002, 29, 1417-1439.
35. Gupta, J.N.D., Two-stage, hybrid flowshop-scheduling problem. J. Oper. Res. Soc., 1988, 39, 359-364.
36. Hundal, T.S. and Rajgopal, J., An extension of Palmer's heuristic for the flow-shopscheduling problem. Int. J. Prod. Res, 1988, 26, 1119-1124.
37. Ishibuchi, H. and Murata, T., A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Sys. Man Cybernet. C Appl. Rev., 1998, 28, 392-403.
38. Ishibuchi, H., Yoshida, T. and Murata, T., Balance between genetic search and local search in mimetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Computat., 2003, 7, 204-223.
39. Itoh, K., Huang, D. and Enkawa, T., Twofold look-ahead search for multi-criterion job shop scheduling. Int. J. Prod. Res., 1993, 31, 2215-2234.
40. Kacem, I., Hammadi, S. and Borne, P., Approach by localization and multiobjective evolutionary optimization for flexible job-shop-scheduling problems. IEEE Trans. Sys. Man Cybernet., 2002, 32, 1-13.
41. Kim, C.-O., Min, H.-S. and Yih, Y., Integration of inductive learning and neural networks for multi-objective FMS scheduling. Int. J. Prod. Res., 1998, 36, 2497-2509.
42. Kyparisis, G.J. and Koulamas, C., A note on weighted completion time minimization in a flexible flow shop. Oper. Res. Lett., 2001, 29, 5-11.
43. Lee, I., Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs. Comput. Oper. Res., 2001, 28, 835-852.
44. Maniezzo, V. and Carbonaro, A., An ANTS heuristic for the frequency assignment problem. Future Generat. Comput. Sys., 2000, 16, 927-935.
45. McMullen, P.R., An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. Art. Intell. Eng., 2001, 15, 309-317.
46. McMullen, P.R., Using search heuristics and an efficient frontier approach to address JIT sequencing problems with setups, in Proceedings of the YOR 11 Conference, 2000.
47. Mellor, P., A review of job shop scheduling. Oper. Res. Q., 1966, 17, 161-170.
48. Merkle, D., Middendorf, M. and Schmeck, H., Ant colony optimization for resourceconstrained project scheduling. IEEE Trans. Evol. Computat., 2002, 6, 333-346.
49. Min, H. S., Yih, Y. and Kim, C.-O., A competitive neural network approach to multiobjective FMS scheduling. Int. J. Prod. Res., 1998, 36, 1749-1765.
50. Mosheiov, G. and Oron, D., A note on the SPT heuristic for solving scheduling problems with generalized due dates. Comput. Oper. Res., 2004, 31, 645-655.
51. Murata, T., Ishibuchi, H. and Tanaka, H., Multi-objective genetic algorithm and its applications to flowshop scheduling. Comput. Ind. Eng., 1996, 30, 957-968.
52. Nagar, A., Haddock, J. and Heragu, S., Multiple and bicriteria scheduling: a literature survey. Eur. J. Oper. Res., 1995, 81, 88-104.
53. Nawaz, M., A heuristic algorithm for the 'M'-machine, 'N' job flow-shop sequencing problem. Manag. Sci., 1983, 11, 91-95.
54. Neppalli, V.R., Chen, C.L. and Gupta, J., Genetic algorithms for two-stage bicriteria flowshop problem. Eur. J. Oper. Res., 1996, 95, 356-373.
55. Nowicki, E. and Czeslaw, S., The flow shop with parallel machines: a tabu search approach. Eur. J. Oper. Res., 1998, 106, 226-253.
56. Rajendran, C. and Ziegler, H., Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs. Comput. Ind. Eng., 1999, 37, 671-690.
57. Rajendran, C. and Ziegler, H., Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. Eur. J. Oper. Res., 2003, 149, 513-522.
58. Saaty, T.L., Fundamentals of Decision Making and Priority Theory with the Analytic Hierarchy Process, 1994 (RWS: Pittsburgh, PA).
59. Santos, D.L., Hunsucker, J.L. and Deal, D.E., Flowmult: permutation sequences for flow shops with multiple processors. J. Informat. Optimiz. Sci., 1995, 16, 351-366.
60. Sawik, T., Mixed-integer programming for scheduling flexible flow lines with limited intermediate buffers. Math. Comput. Model., 2000, 31, 39-52.
61. Sawik, T., An exact approach for batch scheduling in flexible flowlines with limited intermediate buffers. Math. Comput. Model., 2002, 36, 461-471.
62. Serafini, P., Scheduling jobs on several machines with the job splitting property. Oper. Res., 1996, 44, 617-628.
63. Sivrikaya-Serifolu, F. and Ulusoy, G., Parallel machine scheduling with earliness and tardiness penalties. Comput. Oper. Res., 1999, 26, 773-787.
64. Sridhar, J. and Rajendran, C., Scheduling in a cellular manufacturing system: a simulated annealing approach. Int. J. Prod. Res., 1993, 31, 2927-2945.
65. Stützle, T. and Hoos, H.H., MAX-MIN ant system. Future Generat. Comput. Sys., 2000, 16, 889-914.
66. Stützle, T. and Hoos, H.H., The MAX-MIN ant system and local search for the traveling salesman problem, in IEEE International Conference on Evolutionary Computation, edited by T. Bäck, Z. Michalewicz and X. Yao, pp. 309-314, 1997 (IEEE Press, Piscataway, NJ).
67. T'kindt, V., Monmarché, N., Tercient, F. and Laügt, D., An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop-scheduling problem. Eur. J. Oper. Res., 2002, 142, 250-257.
68. Wardono, B. and Fathi, Y., A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. Eur. J. Oper. Res., 2004, 155, 380-401.
69. Zwaan, S.V.D. and Marques, C., Ant colony optimisation for job shop scheduling, in Proceedings of the Third Workshop on Genetic Algorithms and Artificial Life, 1999.