Wenwen Lin This email address is being protected from spambots. You need JavaScript enabled to view it.1, Lei Wang1 , Rengkai Zhou1 , Yuejun Zhang1 and Chaoyong Zhang2

1Faculty of Mechanical Engineering & Mechanics, Ningbo University, Ningbo 315211, P.R. China
2State Key Laboratory of Digital Manufacturing Equipment & Technology, Huazhong University of Science & Technology, Wuhan 430074, P.R. China


 

Received: January 9, 2018
Accepted: June 13, 2018
Publication Date: December 1, 2018

Download Citation: ||https://doi.org/10.6180/jase.201812_21(4).0002  

ABSTRACT


In job shop scheduling problems, the previously used nonpreemptive schedules are semiactive, active, and non-delay schedules, and they are initially designed for traditional scheduling performances and do not take energy efficiency into consideration. To fill the gap, this article presents a novel class of nonpreemptive schedules by investigating the special properties of job shop scheduling problems. Then, an energy-efficient generation procedure of the novel nonpreemptive schedules and the standby policy are proposed. An improved genetic algorithm is introduced with three superior features, including the elitist selection, the improved generation alternation model, and the operator decision mechanism. The Friedman test and the Holm multiple comparison test are conducted on experimental results to determine the appropriate parameter for the proposed genetic algorithm. Finally, the computation results and two-sample t-tests show that both energy-efficient generation procedure and standby policy help to reduce energy consumption without worsening production efficiency.


Keywords: Job Shop, Energy-efficient Scheduling, Nonpreemptive Schedule, Genetic Algorithm, Statistical Test


REFERENCES


  1. [1] IPCC (2014) Climate Change 20014: Synthesis Report. Summary for Policymakers, IPCC. doi: 10.1017/CBO 9780511546013.003
  2. [2] EIA (2014) International Energy Outlook 2014, DOE/ EIA-0484, US Energy Information Administration (EIA) www.eia.gov/ieo/.
  3. [3] Mouzon, G., M. B. Yildirim, and J. Twomey (2007) “Operational Methods for Minimization of Energy Consumption of Manufacturing Equipment, International Journal of Production Research 45(1819), 4247 4271. doi: 10.1080/00207540701450013
  4. [4] Mouzon, G., and M. B. Yildirim (2008) A Framework to Minimise Total Energy Consumption and Total Tardiness on a Single Machine, Int J Sus Eng 1(2), 105 116. doi: 10.1080/19397030802257236
  5. [5] Lin, W., D. Y. Yu, C. Zhang, X. Liu, S. Zhang, Y. Tian, S. Liu, and Z. Xie (2015) A Multi-objective Teachinglearning-based Optimization Algorithm to Scheduling in Turning Processes for Minimizing Makespan and Carbon Footprint, Journal of Cleaner Production 101, 337347. doi: 10.1016/j.jclepro.2015.03.099
  6. [6] May, G., B. Stahl, M. Taisch, and V. Prabhu (2015) Multi-objective Genetic Algorithm for Energy-efficient Job Shop Scheduling, International Journal of Production Research 53(23), 70717089. doi: 10. 1080/00207543.2015.1005248
  7. [7] Fang, K., N. Uhan, F. Zhao, and J. Sutherland (2013) “Flow Shop Scheduling with Peak Power Consumption Constraints, Annals of Operations Research 206(1), 115145. doi: 10.1007/s10479-012-1294-z
  8. [8] Ding, J. Y., S. Song, and C. Wu (2016) Carbon-efficient Scheduling of Flow Shops by Multi-objective Optimization, European Journal of Operational Research 248(3), 758771. doi: 10.1016/j.ejor.2015.05. 019
  9. [9] Salido, M. A., J. Escamilla, A. Giret, and F. Barber (2015) “A Genetic Algorithm for Energy-efficiency in Job-shop Scheduling, The International Journal of Advanced Manufacturing Technology 112. doi: 10. 1007/s00170-015-7987-0
  10. [10] Zhang, R., and R. Chiong (2016) Solving the Energyefficient Job Shop Scheduling Problem: a Multi-objective Genetic Algorithm with Enhanced Local Search for Minimizing the Total Weighted Tardiness and Total Energy Consumption, Journal of Cleaner Production 112(4), 33613375. doi: 10.1016/j.jclepro.2015. 09.097
  11. [11] Liu, Q. T., Z. Y. Cai, X. T. Liu, and J. Zan (2011) Multi-objective Optimization for Job Shop Scheduling in Green Manufacturing, Journal of Chang’an University (Natural Science Edition) 2, 024.
  12. [12] Liu, Y., H. Dong, N. Lohse, S. Petrovic, and N. Gindy (2014) An Investigation into Minimising Total Energy Consumption and Total Weighted Tardiness in Job Shops, Journal of Cleaner Production 65, 8796. doi: 10.1016/j.jclepro.2013.07.060
  13. [13] Pinedo, M. (2012) Scheduling: Theory, Algorithms, and Systems.
  14. [14] Zhang, C., Y. Rao, and P. Li (2008) An Effective Hybrid Genetic Algorithm for the Job Shop Scheduling Problem, The International Journal of Advanced Manufacturing Technology 39(9), 965974. doi: 10.1007/ s00170-007-1354-8
  15. [15] Cheng, R., M. Gen, and Y. Tsujimura (1996) A Tutorial Survey of Job-shop Scheduling Problems Using Genetic Algorithms—I. Representation, Computers & Industrial Engineering 30(4), 983997. doi: 10.1016/ 0360-8352(96)00047-2
  16. [16] Jiang, Z., H. Zhang, and J. W. Sutherland (2012) Development of an Environmental Performance Assessment Method for Manufacturing Process Plans, The International Journal of Advanced Manufacturing Technology 58(5), 783790. doi: 10.1007/s00170-011- 3410-7
  17. [17] Dai, M., D. Tang, A. Giret, M. A. Salido, and W. D. Li (2013) Energy-efficient Scheduling for a Flexible Flow Shop Using an Improved Genetic-simulated Annealing Algorithm, Robotics and Computer-Integrated Manufacturing 29(5), 418429. doi: 10.1016/j.rcim. 2013.04.001
  18. [18] Yan, J., L. Li, F. Zhao, F. Zhang, and Q. Zhao (2016) A Multi-level Optimization Approach for Energy-efficient Flexible Flow Shop Scheduling, Journal of Cleaner Production 137, 15431552. doi: 10.1016/j.jclepro. 2016.06.161
  19. [19] Derrac, J., S. García, D. Molina, and F. Herrera (2011) A Practical Tutorial on the Use of Nonparametric Statistical Tests as a Methodology for Comparing Evolutionary and Swarm Intelligence Algorithms, Swarm and Evolutionary Computation 1(1), 318. doi: 10. 1016/j.swevo.2011.02.002
  20. [20] Holm, S. (1979) A Simple Sequentially Rejective Multiple Test Procedure, Scandinavian Journal of Statistics 6(2), 6570.