A new ILP model for identical parallel-machine scheduling with family setup times minimizing the total weighted flow time by a genetic algorithm

International Journal of Engineering, Transactions A: Basics

Volumn 20, Issue 2, 2007, Pages 183-194

  Tavakkoli Moghaddam, R ^a   Mehdizadeh, E ^b  

^a UNIVERSITY OF TEHRAN   (Iran)

^b ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Family setup times; Genetic algorithm; Ilp model; Parallel machine scheduling; Total weighted flow time

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEARIZATION; MACHINERY; MATHEMATICAL MODELS; OPTIMAL SYSTEMS; OPTIMIZATION; PARALLEL ALGORITHMS;

CLASSICAL OPTIMIZATION; COMPUTATIONAL TIME; FAMILY SET-UP TIME; FAMILY SETUP TIMES; FLOW-TIME; ILP MODEL; ILP MODELS; LARGE SIZES; MACHINE SCHEDULING; MACHINE SCHEDULING PROBLEM; META-HEURISTIC METHODS; NEAR-OPTIMAL SOLUTIONS; NP-HARD; OPTIMAL SOLUTIONS; PARALLEL MACHINE SCHEDULING; SET-UP TIME; TEST PROBLEM; TOTAL WEIGHTED FLOW TIME;

SCHEDULING ALGORITHMS;

EID: 67649908910     PISSN: 17281431     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. Ahn, B. H. and Hyun, J. H., "Single facility multi-class job scheduling", Computers and Operations Research, Vol. 17, (1990), 265-72.
2. Wardono, B. and Fathi, Y., "A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities", European Journal of Operational Research, Vol. 155, (2004), 380-401.
3. Bjorndal, M, Caprara, A., Cowling, P., Croce, P. Lourence, H., Malucelli, F., Orman, A., Pisinger, D., Rego, C. and Salazar, J., "Some thoughts on combinatorial optimization", European Journal of Operational Research, Vol. 83, (1990), 253-270.
4. Cheng, T. and Sin, C., "A state-of-the-art review of parallel-machine scheduling research", European Journal of Operational Research, Vol. 47, (1990), 271-292.
5. Allahverdi, A., Ng, C. T., Cheng, T. C. E. and Kovalyov, M. Y., "A survey of scheduling problems with setup times or costs", European Journal of Operational Research, to appear in, (2007), DOI: 10.1016/j.ejor., (2006).06.060.
6. Potts, C. N. and Kovalyov, M. Y., "Scheduling with batching: A review", European Journal of Operational Research, Vol. 120, (2000), 228-249.
7. Webster, S. and Azizoglu, M., "Dynamic programming algorithms for scheduling parallel machines with family setup times", Computers and Operations Research, Vol. 28, (2001), 127-137.
8. Bruno, L, Coofman, J. and Sethi, R., "Scheduling independent tasks reduce mean finishing time", Communications on ACM, Vol. 17, (1974), 382-387.
9. Garey, M. R. and Johnson, D. S., "Computers and intractability: a guide to the theory of NP- completeness", San Francisco, CA: Freeman, (1979).
10. Webster, S. T., "The complexity of scheduling job families about a common due date", Operations Research Letters, Vol. 20, (1997), 65-74.
11. Bruno, J. and Sethi, R., "Task sequencing in a batch environment with setup times", Foundations of Control Engineering, Vol. 3, (1978), 105-117.
12. Mason, A. J. and Anderson, E. J., "Minimizing flow time on a single machine with job classes and setup times", Naval Research Logistics, Vol. 38, (1991), 333-350.
13. Monma, C. L. and Potts, C. N., "On the complexity of scheduling with batch setup times", Operations Research, Vol. 37, (1989), 798-804.
14. Ramachandra, G. and Elmaghraby, S. E., "Sequencing precedence-related jobs on two machines to minimize the weighted completion time", Int. J. Production Economics, Vol. 100, (2006), 44-58.
15. Nessah, R., Chu, C. and Yalaoui, F., "An exact method for problem", Computers and Operations Research, Vol. 34, (2007), 2840-2848.
16. Monch, L., Balasubramanian, H., Fowler, W. J. and Pfund, E. M., "Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times", Computers and Operations Research, Vol. 32, (2005), 2731-2750.
17. Leung, J. Y. - T., Li, H. and Pinedo, M. L., "Scheduling orders for multiple product types to minimize total weighted completion time", Discrete Applied Mathematics, Vol. 155, (2007), 945-970.
18. Zhu, Z. and Heady, R. B., "Minimizing the sum of earliness/tardiness in multi machine scheduling with sequence dependant setups on uniform parallel machines", Computer and Industrial Engineering, Vol. 38, (2000), 297-305.
19. Omar, M. K. and Teo, S. C., "Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach", Applied Mathematics and Computation, Vol. 181, (2006), 1008-1017.
20. Biskup, D. and Cheng, T. C. E., "Multiple-machine scheduling with earliness, tardiness and completion time penalties", Computer and Operations Research, Vol. 26, (1999), 45-57
21. Caoa, D., Chen, M. and Wan, G., "Parallel machine selection and job scheduling to minimize machine cost and job tardiness", Computers and Operations Research, Vol. 32, (2005), 1995-2012.
22. Balakrishnan, N., Kanet, J. and Sridharan, S. V., "Early/tardy scheduling with sequence dependent setups on uniform parallel machines", Computer and Operations Research, Vol. 26, (1999), 127-141.
23. Dunstall, S., Wirth, A. and Baker, K., "Lower bounds and algorithms for flow time minimization on a single machine with set-up times", Journal of Scheduling, Vol. 3, (2000) 51-69.
24. Park, Y., Kim, S. and Lee, Y. - H., "Scheduling jobs on parallel machines applying neural network and heuristic rules", Computers and Industrial Engineering, Vol. 38, (2000), 189-202.
25. Li, C. and Cheng, T., "The parallel machine min-max weighted absolute lateness scheduling problem", Naval Research Logistics, Vol. 41, (1993), 33-46.
26. Cheng, R. and Gen, M., "MinMax earliness/tardiness scheduling in identical parallel machine system using genetic algorithm", Computer and Industrial Engineering, Vol. 29, No. 1-4, (1995), 513-517.
27. Kim, D. - W., Kim, K. - H. Wooseung, Jang, F. and Chen, F., "Unrelated parallel machine scheduling with setup times using simulated annealing", Robotics and Computer Integrated Manufacturing, Vol. 18, (2002), 223-231.
28. Tavakkoli-Moghaddam, R., Jolai, F., Khodadadeghan, Y. and Haghnevis, M., "A mathematical model of a multi-criteria parallel machine scheduling problem: a genetic algorithm", International Journal of Engineering, Transactions A: Basic, Vol. 19, No. 1, (2006), 79-86.
29. Melve, S. and Uzsoy, R., "A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families", Computers and Operations Research, Vol. 34, (2007), 3016-3028.
30. Gen, M. and Cheng, R., "Genetic algorithms and engineering design", John Wiley and Sons, New York, (1997).
31. Leonardi, S. and Raz, D., "Approximating total flow time on parallel machines", Journal of Computer and System Science, Vol. 73, (2007), 875-891.
32. Kang, L. and Ng, C. T., "A note on a fully polynomialtime approximation scheme for parallel-machine scheduling with deteriorating jobs", International of Journal of Production Economics, Vol. 109, (2007), 180-184.