A framework to minimise total energy consumption and total tardiness on a single machine

A great amount of energy is wasted in industry by machines that remain idle due to underutilisation. A way to avoid wasting energy and thus reducing the carbon print of an industrial plant is to consider minimisation of energy consumption objective while making scheduling decisions. To minimise energy consumption, the decision maker has to decide the timing and length of turn off/turn on operation (a setup) and also provide a sequence of jobs that minimises the scheduling objective, assuming that all jobs are not available at the same time. In this paper, a framework to solve a multiobjective optimisation problem that minimises total energy consumption and total tardiness is proposed. Since total tardiness problem with release dates is an NP‐hard problem, a new greedy randomised multiobjective adaptive search metaheuristic is utilised to obtain an approximate pareto front (i.e. an approximate set of non‐dominated solutions). Analytical Hierarchy Process is utilised to determine the ‘best’ alternative among the solutions on the pareto front. The proposed framework is illustrated in a case study. It is shown that a wide variety of dispersed solutions can be obtained via the proposed framework, and as total tardiness decreases, total energy consumption increases.

[1]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[2]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[3]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[4]  Binoy Ravindran,et al.  Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems , 2006, TECS.

[5]  Alexander Thomasian,et al.  A GRASP algorithm for the multi-objective knapsack problem , 2004 .

[6]  Krishnendu Chakrabarty,et al.  Energy-conscious, deterministic I/O device scheduling in hard real-time systems , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[8]  Vinícius Amaral Armentano,et al.  Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times , 2006, J. Heuristics.

[9]  Janet M. Twomey,et al.  Operational methods for minimization of energy consumption of manufacturing equipment , 2007 .

[10]  Dalessandro Soares Vianna,et al.  A GRASP algorithm for the multi-objective knapsack problem , 2004, XXIV International Conference of the Chilean Computer Science Society.

[11]  Jorge Andrés Alvarado-Valencia,et al.  Greedy Randomized Adaptive Search Procedure (GRASP) , 2010 .

[12]  Mehrdad Tamiz,et al.  Multi-objective meta-heuristics: An overview of the current state-of-the-art , 2002, Eur. J. Oper. Res..

[13]  Tapan Sen,et al.  Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey , 2003 .

[14]  Frank L. Lewis,et al.  Energy-efficient wireless sensor network design and implementation for condition-based maintenance , 2007, TOSN.

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

[16]  José Luis González Velarde,et al.  A search heuristic for just-in-time scheduling in parallel machines , 1991, J. Intell. Manuf..

[17]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[18]  Lawrence E. Whitman,et al.  Data collection framework on energy consumption in manufacturing , 2006 .

[19]  Binoy Ravindran,et al.  Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems , 2004, EMSOFT '04.

[20]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.