A discrete particle swarm optimization algorithm for single machine total earliness and tardiness problem with a common due date

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 3281-3288

  Pan, Quan Ke ^a   Tasgetiren, M Fatih ^b   Liang, Yun Chia ^c  

^a LIAOCHENG UNIVERSITY   (China)

^b FATIH UNIVERSITY   (Turkey)

^c YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; PROBLEM SOLVING; TIME MEASUREMENT;

HRM; OR LIBRARY; PARTICLE SWARM OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 34547260983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. D. Biskup and M. Feldmann, "Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates," Computers & Operations Research, vol. 28, pp. 787-801, 2001.
2. T. C E. Cheng, and H. G. Kahlbacher, "A proof for the longest/job/first policy in one/machine scheduling," Naval Research Logistics, vol. 38, pp. 715-720, 1990.
3. R. C Eberhart and J. Kennedy, "A new optimizer using particle swarm theory," in Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, pp. 39-43.
4. M. Feldmann and D. Biskup, "Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches," Computers & Industrial Engineering, vol. 44, pp. 307-323, 2003.
5. N. G. Hall, W. Kubiak, and S. P. Sethi, "Earliness-tardiness scheduling problems II: weighted deviation of completion times about a restrictive common due date," Operations Research, vol. 39, no. 5, pp. 847-856, 1991.
6. Y. Hendel and F. Sourd, "Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem," European Journal of Operational Research, to appear.
7. C. M. Hino, D. P. Ronconi, and A. B. Mendes, "Minimizing earliness and tardiness penalties in a single-machine problem with a common due date," European Journal of Operational Research, vol. 160, pp. 190-201, 2005.
8. R. J. W. James and J. T. Buchanan, "Using tabu search to solve the common due date early/tardy machine scheduling problem," Computers & Operations Research, vol. 24, pp. 199-208, 1997.
9. J. Kennedy, R. C. Eberhart, and Y. Shi, Swarm Intelligence. San Mateo, Morgan Kaufmann, CA, USA, 2001.
10. C. Y. Lee and J. Y. Choi, "A genetic algorithm for jobs sequencing with distinct due dates and general, early-tardy penalty weights," Computers & Operations Research, vol. 22, pp. 857-869, 1995.
11. C Y. Lee and S. J. Kim, "Parallel genetic algorithms for the earliness/tardiness job scheduling problem with general penalty weights," Computers & Industrial Engineering, vol. 28, pp. 231-243, 1995.
12. R. M'Hallah, "Minimizing total earliness and tardiness on a single machine using a hybrid heuristic," Computers & Operations Research, to appear.
13. Q. K. Pan, M. F. Tasgetiren, and Y. C. Liang, "A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion", in Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group, UK PLANSIG2005. City University, London, pp. 3443
14. Q. K. Pan, M. F. Tasgetiren, and Y. C Liang, "A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan and total flowtime criteria," (Under review by Computers & Operations Research).
15. M. F. Tasgetiren, M. Sevkli, Y. C Liang, and G. Gencyilmaz, "Particle swarm optimization algorithm for permutation flowshop sequencing problem," in Proceedings of the 4th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2004), LNCS 3172, Brussels, Belgium, 2004, pp. 382-390.
16. M. F. Tasgetiren, Y. C Liang, M. Sevkli, and G. Gencyilmaz, "Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem," European Journal of Operational Research, to appear.
17. G. Wan and B. P. C. Yen, "Tabu search for single machine with distinct due windows and weighted earliness/tardiness penalties," European Journal of Operational Research, vol. 142, pp. 271-281, 2002.