Bi-objective optimization for single-machine batch scheduling considering energy cost

Electricity is one of most widely used energies and encouraged to be saved by scientific management and new technologies such as Time-of-Use policy. Batch scheduling can significantly improve production efficiency and is used in many high electricity consumption and high technology industries. This paper investigates a new bi-objective single machine batch scheduling problem with TOU policy. The first objective is to improve productivity and the second aims to minimize the total electricity cost. For the problem, a bi-objective mixed integer nonlinear programming model is formulated. Its corresponding single objective optimization problems are linearized by analyzed properties such that the multiobjective ε-constraint method can be used to obtain Pareto solutions.

[1]  R. Uzsoy.  Scheduling a single batch processing machine with non-identical job sizes , 1994 .

[2]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[3]  Michel Gendreau,et al.  An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits , 2009, Eur. J. Oper. Res..

[4]  Chung-Lun Li,et al.  Scheduling with agreeable release times and due dates on a batch processing machine , 1997 .

[5]  Xiaoli Wang,et al.  Minimizing makespan on a single batching machine with release times and non-identical job sizes , 2005, Oper. Res. Lett..

[6]  Huai Gao,et al.  A modeling method of task-oriented energy consumption for machining manufacturing system , 2012 .

[7]  Lingfeng Wang,et al.  Smart meters for power grid — Challenges, issues, advantages and status , 2011, 2011 IEEE/PES Power Systems Conference and Exposition.

[8]  Iiro Harjunkoski,et al.  Continuous-time Batch Scheduling Approach for Optimizing Electricity Consumption Cost , 2013 .

[9]  C. S. Sung,et al.  Minimizing makespan on a single burn-in oven in semiconductor manufacturing , 2000, Eur. J. Oper. Res..

[10]  Ruyan Fu,et al.  The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan , 2008 .

[11]  Mehmet Bayram Yildirim,et al.  A framework to minimise total energy consumption and total tardiness on a single machine , 2008 .

[12]  Adriana Giret,et al.  Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm , 2013 .

[13]  Evripidis Bampis,et al.  Energy Aware Scheduling for Unrelated Parallel Machines , 2012, 2012 IEEE International Conference on Green Computing and Communications.

[14]  Ching-Jong Liao,et al.  An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups , 2007, Comput. Oper. Res..

[15]  Purushothaman Damodaran,et al.  Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms , 2006 .

[16]  Peter Schuur,et al.  Dynamic Job Assignment Heuristics for Multi-Server Batch Operations , 1997 .

[17]  MengChu Zhou,et al.  $\varepsilon$-Constraint and Fuzzy Logic-Based Optimization of Hazardous Material Transportation via Lane Reservation , 2013, IEEE Transactions on Intelligent Transportation Systems.

[18]  Massimo Paolucci,et al.  Energy-aware scheduling for improving manufacturing process sustainability: A mathematical model for flexible flow shops , 2012 .

[19]  John W. Sutherland,et al.  A New Shop Scheduling Approach in Support of Sustainable Manufacturing , 2011 .

[20]  D. J. V. D. ZEEt,et al.  Dynamic job assignment heuristics for multi-server batch operations-A cost based approach , 2011 .

[21]  Babak Mozafari,et al.  Designing time-of-use program based on stochastic security constrained unit commitment considering reliability index , 2012 .

[22]  Yoshiro Ikura,et al.  Efficient scheduling algorithms for a single batch processing machine , 1986 .

[23]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .

[24]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

[25]  Y. Wang,et al.  Time-of-use based electricity demand response for sustainable manufacturing systems , 2013 .

[26]  Clarisse Dhaenens,et al.  Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure , 2002, Comput. Oper. Res..

[27]  George Q. Huang,et al.  Hybrid flow shop scheduling considering machine electricity consumption cost , 2013 .

[28]  Lixin Tang,et al.  Minimizing makespan in a two-machine flowshop scheduling with batching and release time , 2009, Math. Comput. Model..

[29]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[30]  Reha Uzsoy,et al.  Minimizing total completion time on a batch processing machine with job families , 1993, Oper. Res. Lett..