A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines

Journal of Intelligent Manufacturing

Volumn 22, Issue 2, 2011, Pages 247-261

  Jolai, F ^a   Amalnick, M S ^a   Alinaghian, M ^b   Shakhsi Niaei, M ^a   Omrani, H ^b  

^a UNIVERSITY OF TEHRAN   (Iran)

^b IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Heuristic algorithms; Hybrid memetic algorithm; Local search; On time jobs; Unrelated parallel machines

Indexed keywords

COMPUTATIONAL EXPERIMENT; CONSTRUCTIVE ALGORITHMS; DUE DATES; HYBRID ALGORITHMS; HYBRID GENETIC ALGORITHMS; INITIAL POPULATION; INTEGER LINEAR PROGRAMMING MODELS; JUST-IN-TIME JOBS; LOCAL SEARCH; MEMETIC ALGORITHMS; MUTATION OPERATORS; NP-HARD; ON-TIME JOBS; PROCESSING TIME; SEARCH PROCESS; UNRELATED PARALLEL MACHINES; WEIGHTED NUMBER;

COMPUTER PROGRAMMING; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING;

MATHEMATICAL OPERATORS;

EID: 79958775423     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-009-0285-7     Document Type: Article

References (24)

1. Baker, K. R., & Su, Z. S. (1974). Sequencing with due dates and early start times to minimize maximum tardiness. Naval Research Logistics Quarterly, 21, 171-176.
2. Blazewicz, J. (1987). Selected topics in scheduling theory. Annals of Discrete Mathematics, 31, 1-60.
3. Č epek, O., & Sung, S. C. (2005). A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers & Operations Research, 32, 3265-3271. (Pubitemid 40749376)
4. Davis, E., & Jaffe, J. M. (1981). Algorithms for scheduling tasks on unrelated parallel processors. Journal of the Association of Computing Machinery, 28, 721-736.
5. Hall, N. G. (2001). Generating experimental data for computational testing with machine scheduling applications. Operations Research, 49(7), 854-865. (Pubitemid 34271873)
6. Hall, N. G., & Rhee, W. T. (1986). Average and worst-case analysis of heuristics for the maximum tardiness problem. European Journal of Operational Research, 26, 272-277.
7. Hiraishi, K., Levner, E., & Vlach, M. (2002). Scheduling of parallel identical machines to maximize the weighted number of just-intime jobs. Computers & Operations Research, 29(7), 841-848. (Pubitemid 34135093)
8. Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor, MI: The University of Michigan Press.
9. Huang, J. C.-C. (1995). Decision support system for lumber procurement and dry kiln scheduling: A fuzzy system theory application. Industrial Engineering Department, Unpublished Ph.D. Dissertation. North Carolina State University, Raleigh, NC.
10. Lann, A., & Mosheiov, G. (1996). Single machine scheduling to minimize the number of early and tardy jobs. Computers & Operations Research, 23, 765-781.
11. Lenstra, J. K., Schmoys, D. B., & Tardos, E. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46, 259-271.
12. Li, C.-L., & Lee, C.-Y. (1997). Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research, 96, 564-569. (Pubitemid 127378189)
13. Mitchell, M. (1996). An introduction to genetic algorithms. London, England: Massachusetts Institute of Technology.
14. Moscato, P. (1999). Memetic algorithms: A short introduction. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 219-234). New York: McGraw-Hill.
15. Panwalkar, S. S., & Iskander, W. (1977). A survey of scheduling rules. Operations Research, 25, 45-61.
16. Piersma, N., & Van Dijk, W. (1996). A local search heuristic for unrelated machine scheduling with efficient neighborhood search. Mathematical and Computational Modelling, 24, 11-19. (Pubitemid 27080098)
17. Portmann, M. C. (1996). Genetic algorithms and scheduling: A state of the art and some propositions. Proceedings of the Workshop on Production Planning and Control, Mons, Belgium.
18. Potts, C. N. (1985). Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics, 10, 155-164. (Pubitemid 15577914)
19. Rabadi, G., Moraga, R. J., & Al-Salem, A. (2006). Heuristics for the unrelated parallel machine scheduling problem with setup times. Journal of Intelligent Manufacturing, 17, 85-97. (Pubitemid 43107327)
20. Sahni, S., & Cho, Y. (1980). Scheduling independent tasks with due time on a uniform processor system. Journal of the Association for Computing Machinery, 27, 550-563.
21. Sung, S. C., & Vlach, M. (2005). Maximizing weighted number of just-in-time jobs on unrelated parallel machines. Journal of Scheduling, 8, 453-460. (Pubitemid 41202892)
22. Suresh, V., & Haudhuri, D. C. (1994). Minimizing maximum tardiness for unrelated parallel machines. International Journal of Production Economics, 34, 223-229.
23. Toksari, M. D., & Güner, E. (2009). Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs. Journal of Intelligent Manufacturing. doi:10.1007/s10845- 009-0260-3.
24. Yaghubian, A., Hodgson, T. J., Joines, J. A., Culbreth, C. T., & Huang, J. C. (1999). Dry kiln scheduling in furniture production. IIE Transactions, 31, 733-738. (Pubitemid 30499395)