Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
WANG Ling. Shop Scheduling with Genetic Algorithms [M]. Beijing: Tsinghua University Press, 2003. (in Chinese)
Koulamas C, Kyparisis G J. Makespan minimization on uniform parallel machines with release times [J]. European Journal of Operational Research, 2004, 157: 262–266.
Hwane H C, Chang Y S. Parallel machine scheduling to minimize total tardiness[J]. Computers Mathematic Application, 1998, 36 (3): 21–31.
Azizoglu M. Preemptive scheduling on identical parallel machines subject to deadlines[J]. European Journal of Operational Research, 2003, 148: 205–210.
Moukrim A, Quilliot A. Optimal preemptive scheduling on a fixed number of identical parallel machines [J]. Operations Research Letters, 2005, 33: 143–150.
Yang J. The complexity of customer order scheduling problems on parallel machines[J]. Computers & Operations Research, 2005, 32: 1921–1939.
Gupta J N, Ruiz-Torres A J. Minimizing makespan subject to minimum total flow-time on identical parallel machines[J]. European Journal of Operational Research, 2000, 125: 370–380.
Liao C J, Shyur D L, Lin C H. Makespan minimization for two parallel machines with an availability constraint[J]. European Journal of Operational Research, 2005, 160: 445–456.
LIU Ming, WU Cheng, ZHANG Long. Optimal common due-date and optimal job scheduling in parallel machine scheduling problem[J]. Journal of Tsinghua University (Science & Technology), 1999, 39(9): 114–117. (in Chinese)
LIU Fei, XU Zong-jun, DAN Bin. Energy Performance of Machining Systems and Its Application[M]. Beijing: China Machine Press, 1995. (in Chinese).
LIU Fei, XU Zong-jun. Study on energy flow models of mechanical transmission systems [J]. Chinese Journal of Mechanical Engineering (English Edition), 1993, 6(3): 215–219.
XU Ning, LI Chun-guang, ZHANG Jian, et al. Studies on some modern optimization algorithms[J]. Systems Engineering and Electronics, 2002, 24(12): 100–103. (in Chinese)
Glover F, Laguna M. Tabu Search[M]. London: Kluwer Academic Publishers, 1997.
Reeves C R. Modern heuristic techniques for combinatorial problems [M]. New York: John Wiley & Sons, 1993.
Wardono B, Fathi Y. A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities[J]. European Journal of Operational Research, 2004, 155: 380–401.
Bilge U, KIrac F, Kurtulan M, et al. A tabu search algorithm for parallel machine total tardiness problem [J]. Computers & Operations Research, 2004, 31: 397–414.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Project (50475062) supported by the National Natural Science Foundation of China; project (2004-47-19) supported by the Natural Science Foundation of Chongqing City of China
Rights and permissions
About this article
Cite this article
He, Y., Liu, F., Cao, Hj. et al. A bi-objective model for job-shop scheduling problem to minimize both energy consumption and makespan. J Cent. South Univ. Technol. 12, 167–171 (2005). https://doi.org/10.1007/s11771-005-0033-x
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11771-005-0033-x