A bi-objective model for job-shop scheduling problem to minimize both energy consumption and makespan

被引：0
作者：
Yan He
Fei Liu
Hua-jun Cao
Cong-bo Li
机构：
[1] Chongqing University,Institute of Green Manufacturing Technology
来源：
Journal of Central South University of Technology | 2005年 / 12卷
关键词：
green manufacturing; job-shop scheduling; tabu search; energy-saving; TH186;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The issue of reducing energy consumption for the job-shop scheduling problem in machining systems is addressed, whose dual objectives are to minimize both the energy consumption and the makespan. First, the biobjective model for the job-shop scheduling problem is proposed. The objective function value of the model represents synthesized optimization of energy consumption and makespan. Then, a heuristic algorithm is developed to locate the optimal or near optimal solutions of the model based on the Tabu search mechanism. Finally, the experimental case is presented to demonstrate the effectiveness of the proposed model and the algorithm.
引用
收藏
页码：167 / 171
页数：4
相关论文
共 50 条
[41]   Solving the integrated lot-sizing and job-shop scheduling problem [J].
Urrutia, Edwin David Gomez ;
Aggoune, Riad ;
Dauzere-Peres, Stephane .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (17) :5236-5254
[42]   Job-shop scheduling problem considering power cost and makespan under time-of-use electricity price [J].
Liang, Peng ;
Chen, Wensi ;
Luo, Mingqiang ;
He, Wa ;
Liu, Guosheng .
JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING, 2019, 19 (04) :929-941
[43]   Minimizing non-processing energy consumption/total weighted tardiness & earliness, and makespan into typical production scheduling model-the job shop scheduling problem [J].
Jyothi, Kilari ;
Dubey, R. B. .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 45 (04) :6959-6981
[44]   New scheduling type applied to solving job-shop scheduling problem [J].
Zhang, Chaoyong ;
Guan, Zailin ;
Liu, Qiong ;
Shao, Xinyu ;
Li, Peigen .
Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering, 2008, 44 (10) :24-31
[45]   A Novel Mathematical Model for the Flexible Job-Shop Scheduling Problem With Limited Automated Guided Vehicles [J].
Yao, Youjie ;
Liu, Qihao ;
Fu, Ling ;
Li, Xinyu ;
Yu, Yanbin ;
Gao, Liang ;
Zhou, Wei .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2025, 22 :7449-7462
[46]   A new exact algorithm for no-wait job shop problem to minimize makespan [J].
Ozolins, A. .
OPERATIONAL RESEARCH, 2020, 20 (04) :2333-2363
[47]   A novel hybrid election campaign optimisation algorithm for multi-objective flexible job-shop scheduling problem [J].
Wang, Shuting ;
Liu, Chuanjiang ;
Pei, Dawei ;
Wang, Jinjiang .
Wang, S. (wangst@mail.hust.edu.cn), 2013, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (07) :160-170
[48]   Comparison of two Meta-Heuristics for the Bi-Objective Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Times [J].
Sacramento, Joao ;
Pedrosa, Joao ;
Chibeles-Martins, Nelson ;
Pinto-Varela, Tania .
30TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, PTS A-C, 2020, 48 :181-186
[49]   Application of Adaptive Particle Swarm Optimization to Bi-level Job-Shop Scheduling Problem [J].
Kasemset, Chompoonoot .
INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2014, 13 (01) :43-51
[50]   Application of Genetic Programming on Makespan Optimization of Job Shop Scheduling Problem [J].
Lu Shaohua ;
Xia Yun .
PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INNOVATION AND MANAGEMENT, VOLS I AND II, 2009, :1284-1291
12345