A hybrid electromagnetism-like algorithm for single machine scheduling problem

Expert Systems with Applications

Volumn 36, Issue 2 PART 1, 2009, Pages 1259-1267

  Chang, Pei Chann ^a   Chen, Shih Hsin ^a   Fan, Chin Yuan ^a  

^a YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Dominance property; Electromagnetism like algorithm; Single machine scheduling; Total deviations

Indexed keywords

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; MACHINERY; SCHEDULING; SCHEDULING ALGORITHMS;

COMBINATORIAL OPTIMIZATION PROBLEMS; DOMINANCE PROPERTIES; ELECTROMAGNETISM-LIKE ALGORITHM; SINGLE MACHINE PROBLEMS; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING; STANDARD GENETIC ALGORITHM; TOTAL DEVIATIONS;

PROBLEM SOLVING;

EID: 56349124838     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2007.11.050     Document Type: Article

References (34)

1. Abdul-Razaq T., and Potts C.N. Dynamic programming state-space relaxation for single machine scheduling. Journal of the Operational Research Society 39 (1988) 141-152
2. Azizoglu M., Kondakci S., and Krica O. Bicriteria scheduling problem involving total tardiness and total earliness penalties. International Journal of Production Economics 23 (1991) 17-24
3. Bean J.C. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6 2 (1994) 154-160
4. Belouadah H., Posner M.E., and Potts C.N. Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics 36 (1992) 213-231
5. Birbil S.I., and Fang S.C. An Electromagnetism-like Mechanism for Global Optimization. Journal of Global Optimization 25 (2003) 263-282
6. Birbil S.I., and Feyzioglu O. A global optimization method for solving fuzzy relation equations. Lecture Notes in Artificial Intelligence 2715 (2003) 718-724
7. Birbil, S.I., Gükan, G., & Listes, O. (2004) Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation. Winter Simulation Conference 2004, pp. 550-558.
8. Chang P.C. A Branch and bound approach for single machine scheduling with earliness and tardiness penalties. Computers and Mathematics with Applications 37 (1999) 133-144
9. Chang P.C., and Lee H.C. A greedy heuristic for Bi-criterion single machine scheduling problems. Computers and Industrial Engineering 22 2 (1992) 121-131
10. Chang P.C., and Lee H.C. A two phase approach for single machine scheduling: Minimizing the total absolute deviation. Journal of the Chinese Institute of Engineers 15 6 (1992) 735-742
11. Chang P.C., Chen S.-H., and Fan C.-Y. Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems. Applied Soft Computing Journal 8 1 (2008) 767-777
12. Debels D., Reyck B.D., Leus R., and Vanhoucke M. A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research 169 (2006) 638-653
13. Glover F., Laguna M., and Marti R. Fundamentals of scatter search and path relinking. Control and Cybernetics 39 (2000) 653-684
14. Hariri A.M.A., and Potts C.N. Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics 36 (1983) 99-109
15. Kim Y.D., and Yano C.A. Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Research logistics 41 (1994) 913-933
16. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
17. Li G. Single machine earliness and tardiness scheduling. European Journal of Operational Research 96 (1997) 546-558
18. Liaw C.F. A branch and bound algorithm for the single machine earliness and tardiness scheduling problem. Computers and Operations Research 26 (1999) 679-693
19. Mendes, J. J. M., Gonçalves, J. F., & Resende, M. G. C. (2005). A random key based genetic algorithm for the resource constrained project scheduling problem. AT&T Labs Research Technical Report TD-6DUK2C.
20. Norman B.A., and Bean J.C. A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics 46 2 (1999) 199-211
21. Norman B.A., and Bean J.C. Scheduling operations on parallel machine tools. IIE Transactions 32 5 (2000) 449-459
22. Ow P.S., and Morton T.E. Filtered beam searches in scheduling. International Journal of Production Research 26 (1988) 35-62
23. Pinedo M. Scheduling: Theory, algorithms, and systems (2002), Prentice Hall, Upper Saddle River, NJ
24. Snyder L.V., and Daskin M.S. A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research 174 1 (2006) 38-53
25. Sourd, F., & Sidhoum, S. K. (2005). An efficient algorithm for the earliness/tardiness scheduling problem. Working Paper - LIP6 (http://www-poleia.lip6.fr/sourd/).
26. Su L.H., and Chang P.C. A heuristic to minimize a quadratic function of job lateness on a single machine. International Journal of Production Economics 55 2 (1998) 169-175
27. Su L.H., and Chang P.C. Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs. Computers and Industrial Engineering 40 4 (2001) 349-360
28. Tasgetiren, M. F., Sevkli, M., Liang, Y. C., & Gencyilmaz, G. (2004). Particle swarm optimization algorithm for single machine total weighted tardiness problem. In Proceedings of the 2004 Congress on Evolutionary Computation (CEC'04) (pp. 1412-1419), Portland, Oregon.
29. Tasgetiren M.F., Sevkli M., Liang Y.C., and Gencyilmaz G. Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. European Journal of Operational Research 177 3 (2007) 1930-1947
30. Valente, J. M. S., & Alves, R. A. F. S. (2003a). Heuristics for the early/tardy scheduling problem with release dates. Working Paper 129. Faculdade de Economia do Porto, Portugal.
31. Valente, J. M. S., & Alves, R. A. F. S. (2003b). Improved heuristics for the early/tardy scheduling problem with no idle time. Working Paper 126. Faculdade de Economia do Porto, Portugal.
32. Wu P., Yang W.H., and Wei N.C. An electromagnetism algorithm of neural network analysis - An application to textile retail operation. Journal of the Chinese Institute of Industrial Engineers 21 1 (2004) 59-67
33. Wu P., Yang K.J., and Hung Y.Y. The study of electromagnetism-like mechanism based fuzzy neural network for learning fuzzy if-then rules. Lecture Notes in Computer Science 3684 (2005) 382-388
34. Wu S.D., Storer R.H., and Chang P.C. One machine rescheduling heuristic with efficiency and stability as criteria. Computers and Operations Research 20 1 (1993) 1-14