Parallel-machine scheduling to minimize tardiness penalty and power cost

Computers and Industrial Engineering

Volumn 64, Issue 1, 2013, Pages 224-234

  Fang, Kuei Tang ^a   Lin, Bertrand M T ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Dynamic voltage scaling; Parallel machine scheduling; Particle swarm optimization; Total weighted tardiness

Indexed keywords

COSTS; ENCODING (SYMBOLS); ENERGY CONSERVATION; ENERGY UTILIZATION; HEURISTIC ALGORITHMS; MACHINERY; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING; VOLTAGE SCALING;

COMPUTATIONAL STUDIES; ENVIRONMENTAL CONCERNS; HIGH PERFORMANCE SYSTEMS; OBJECTIVE FUNCTIONS; PARALLEL MACHINE SCHEDULING; SOLUTION REPRESENTATION; TARDINESS PENALTIES; TOTAL-WEIGHTED TARDINESS;

JOB SHOP SCHEDULING;

EID: 84869106299     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2012.10.002     Document Type: Article

References (29)

1. Ai, J., & Kachitvichyanukul, V. (2009). Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering, 56(1), 380-387.
2. Akgul, Y., Puschini, D., Lesecq, S., Miro-Panades, I., Benoit, P., & Torres L. et al. (2012). Power mode selection in embedded systems with performance constraints. In Proceedings of the faible tension faible consommation conference. IEEE, June 6-8 (pp.1-4).
3. Anghinofi, D., & Paolucci, M. (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research, 34(11), 3471-3490. (Pubitemid 46517867)
4. Baker, KR. (1974). Introduction to sequencing and scheduling. New York: Wiley.
5. Bunde, DP. (2006). Power-aware scheduling for makespan and flow. Journal of Scheduling, 12(5), 489-500.
6. Du, J., & Leung, JY. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483-495.
7. Dye, CY., & Ouyang, LY. (2011). A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and trade credit financing. Computers & Industrial Engineering, 60(1), 127-137.
8. Garey, MR., & Johnson, DS. (1978). ''Strong'' NP-completeness results: Motivation, examples, and implications. Journal of the Association for Computing Machinery, 25(3), 499-508.
9. Ge, R., Feng, X., & Cameron, K. W. (2005). Performance-constrained distributed DVS scheduling for scientific applications on power-aware clusters. In Proceedings of the ACM/IEEE conference on supercomputing, November 12-18, Seattle, Washington (pp. 34-44).
10. Graham, RL. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45, 1563-1581.
11. Hall, NG., & Posner, ME. (2000). Generating experimental data for computational testing with machine scheduling applications. Operations Research, 49(6), 854-865. (Pubitemid 34271873)
12. Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Research report 43. Management Science Research Project, UCLA.
13. Kashan, A., & Karimi, B. (2009). A discrete particle swarm optimization algorithm for scheduling parallel machines. Computers & Industrial Engineering, 56(1), 216-223.
14. Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. In Proceedings of IEEE international conference on neural networks (pp. 1942-1948).
15. Koomey, J. G. (2007). Estimating total power consumption by servers in the US and the world. . http://enterprise.amd.com/Downloads/ svrpwrusecompletefinal.pdf
16. Kumar, P. R., & Palani, S. (2012). A dynamic voltage scaling with single power supply and varying speed factor for multiprocessor system using genetic algorithm. In Proceedings of the international conference on pattern recognition, informatics and medical engineering, March 21-23 (pp.342-346).
17. Lawler, E. L. (1977). A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331-342.
18. Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
19. Nezhad, A. M., & Mahlooji, H. (2011). A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems. Computers & Operations Research, 38(8), 1164-1174.
20. Niu, Q., Zhou, T., & Wang, L. (2010). A hybrid particle swarm optimization for parallel machine total tardiness scheduling. International Journal of Advanced Manufacturing Technology, 49, 723-739.
21. Onut, S., Tuzkaya, R. U., & Dogac, B. 2008). A particle swarm optimization algorithm for the multiple level warehouse layout design problem. Computers & Industrial Engineering 54 4 783-799 (Pubitemid 351458379)
22. Rizvandi, N. B., Zomaya, A. Y., Lee, Y. C., Boloori, A. J., & Taheri, J. (2012). Multiple frequency selection in DVFS-enabled processors to minimize energy consumption. arXiv:1203.5160v1, ed.
23. Runwei, C., Mitsuo, G., & Tatsumi, T. (1995). Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms. Computers & Industrial Engineering, 29(1), 513-517.
24. Smith, WE. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59-66.
25. Xia, W., & Wu, Z. (2005). An effective hybrid optimization approach for multiobjective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48(2), 409-425. (Pubitemid 40274933)
26. Zhang, GH., Shao, XY., Li, PG., & Gao, L. (2009). An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers & Industrial Engineering, 56(4), 1309V1318.
27. Zhu, D., Melhem, R., & Childers, BR. (2003). Scheduling with dynamic voltage/speed adjustment using slack reclamation in multiprocessor real-time systems. IEEE Transaction on Parallel and Distributed Systems, 14(7), 686-700.
28. Zhu, D., Mosse, D., & Melhem, R. (2004). Power-aware scheduling for AND/OR graphs in real-time systems. IEEE Transactions on Parallel and Distributed Systems, 15(9), 849-864.
29. Zitzler, E., & Thiele, L. (1998). Multiobjective optimization using evolutionary algorithms - A comparative case study. In Proceedings of the 5th conference on parallel problem solving from nature (PPSN5). Lecture notes in computer science (Vol. 1498, pp. 292-301).Springer Verlag.