Energy consumption minimization for single machine scheduling with bounded maximum tardiness

This paper investigates a single machine scheduling problem to minimize energy consumption with bounded maximum tardiness. A set of jobs are to be processed on a single machine which is speed-scalable. Each job is characterized by its release time, deadline and processing time. The machine can process only one job with some speed at a time. No preemption is allowed. Since energy consumption is associated with the processing speed, both job sequencing and speed choosing decisions have to be made. Two MILP (mixed integer linear programming) models, which respectively use dichotomous constraints and assignment constraints to model the processing sequence of jobs, are built for this problem. The models are implemented in C++ and solved by CPLEX. Computational results with randomly generated instances demonstrate that the model using assignment constraints is much more efficient than that with dichotomous constraints.

[1]  Sanja Petrovic,et al.  An investigation into minimising total energy consumption and total weighted tardiness in job shops , 2014 .

[2]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[3]  David P. Bunde.  Power-aware scheduling for makespan and flow , 2009, J. Sched..

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

[5]  Evripidis Bampis,et al.  Throughput maximization for speed scaling with agreeable deadlines , 2016, J. Sched..

[6]  Evripidis Bampis,et al.  Speed scaling with power down scheduling for agreeable deadlines , 2011, Sustain. Comput. Informatics Syst..

[7]  Cheng-Hsiang Liu,et al.  Approximate trade-off between minimisation of total weighted tardiness and minimisation of carbon dioxide (CO2) emissions in bi-criteria batch scheduling problem , 2014, Int. J. Comput. Integr. Manuf..

[8]  Lap-Kei Lee,et al.  Scheduling for Weighted Flow Time and Energy with Rejection Penalty , 2011, STACS.

[9]  John W. Sutherland,et al.  Flow shop scheduling with peak power consumption constraints , 2013, Ann. Oper. Res..

[10]  M Ross.  Efficient energy use in manufacturing. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Evripidis Bampis,et al.  Speed scaling on parallel processors with migration , 2011, Euro-Par.

[12]  Bertrand M. T. Lin,et al.  Parallel-machine scheduling to minimize tardiness penalty and power cost , 2013, Comput. Ind. Eng..

[13]  Fan T. Tseng,et al.  New MILP models for the permutation flowshop problem , 2008, J. Oper. Res. Soc..

[14]  Antonios Antoniadis,et al.  Non-preemptive speed scaling , 2013, J. Sched..

[15]  Evripidis Bampis,et al.  Speed Scaling for Maximum Lateness , 2015, Theory of Computing Systems.

[16]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[17]  Susanne Albers,et al.  Speed scaling on parallel processors , 2007, SPAA.