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

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.

Keywords

green manufacturing / job-shop scheduling / tabu search / energy-saving

References

[1] WangLingShop Scheduling with Genetic Algorithms [M], 2003, Beijing, Tsinghua University Press(in Chinese)

[2] KoulamasC, KyparisisG J. Makespan minimization on uniform parallel machines with release times [J]. European Journal of Operational Research, 2004, 157: 262-266

[3] HwaneH C, ChangY S. Parallel machine scheduling to minimize total tardiness[J]. Computers Mathematic Application, 1998, 36(3): 21-31

[4] AzizogluM. Preemptive scheduling on identical parallel machines subject to deadlines[J]. European Journal of Operational Research, 2003, 148: 205-210

[5] MoukrimA, QuilliotA. Optimal preemptive scheduling on a fixed number of identical parallel machines [J]. Operations Research Letters, 2005, 33: 143-150

[6] YangJ. The complexity of customer order scheduling problems on parallel machines[J]. Computers & Operations Research, 2005, 32: 1921-1939

[7] GuptaJ N, Ruiz-TorresA J. Minimizing makespan subject to minimum total flow-time on identical parallel machines[J]. European Journal of Operational Research, 2000, 125: 370-380

[8] LiaoC J, ShyurD L, LinC H. Makespan minimization for two parallel machines with an availability constraint[J]. European Journal of Operational Research, 2005, 160: 445-456

[9] LiuMing, WuCheng, ZhangLong. 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)

[10] LiuFei, XuZong-jun, DanBinEnergy Performance of Machining Systems and Its Application[M], 1995, Beijing, China Machine Press(in Chinese)

[11] LiuFei, XuZong-jun. Study on energy flow models of mechanical transmission systems [J]. Chinese Journal of Mechanical Engineering (English Edition), 1993, 6(3): 215-219

[12] XuNing, LiChun-guang, ZhangJian, et al.. Studies on some modern optimization algorithms[J]. Systems Engineering and Electronics, 2002, 24(12): 100-103(in Chinese)

[13] GloverF, LagunaMTabu Search[M], 1997, London, Kluwer Academic Publishers

[14] ReevesC RModern heuristic techniques for combinatorial problems [M], 1993, New York, John Wiley & Sons

[15] WardonoB, FathiY. 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

[16] BilgeU, KIracF, KurtulanM, et al.. A tabu search algorithm for parallel machine total tardiness problem [J]. Computers & Operations Research, 2004, 31: 397-414