1,805 research outputs found

    Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs

    No full text
    Nowadays, energy-efficient scheduling has assumed a key role in ensuring the sustainability of manufacturing processes. In this context, we focus on the bi-objective problem of scheduling a set of jobs on identical parallel machines to simultaneously minimize the maximum completion time and the total energy consumption over a time horizon partitioned into a set of discrete slots. The energy costs are determined by a time-of-use pricing scheme, which plays a crucial role in regulating energy demand and flattening its peaks. First, we uncover a symmetry-breaking property that characterizes the structure of the solution space of the problem. As a consequence, we provide a novel, compact mixed-integer linear programming formulation at the core of an efficient exact solution algorithm. A thorough experimental campaign shows that the use of the novel mathematical programming formulation enables the solution of larger-scale instances and entails a reduction in the computational times as compared to the formulation already available in the literature. Furthermore, we propose a new heuristic that improves the state-of-the-art in terms of required computational effort and quality of solutions. Such a heuristic outperforms the existing heuristics for the problem and is also capable of speeding up the exact solution algorithm when used for its initialization. Finally, we introduce a novel dynamic programming algorithm that is able to compute the optimal timing of the jobs scheduled on each machine to further improve the performance of the new heuristic

    Scheduling on Identical Parallel Machines with Time-of-Use Costs

    No full text
    In the latest years, energy-efficient scheduling has become an increasingly compelling and relevant matter due to both the rising global pollution levels and the growing interest of the industry towards sustainable manufacturing [1]. Specifically, many efforts have been devoted towards scheduling with the Time-of-Use (TOU) energy consumption model [2]. A scheduling horizon subject to a TOU policy is partitioned into different time slots, each one characterized by a different cost. The typical goal is to assign jobs to available machines in order to minimize the total energy consumption together with other possible objectives, such as the makespan or the total weighted tardiness. In this work, we consider the problem of scheduling a set of independent jobs on a set of identical, parallel machines with the objective of simultaneously minimizing the makespan and the total energy consumption. In more detail, we build upon [3] and provide an enhanced heuristic as well as a novel mixed-integer programming formulation. Finally, we show the effectiveness of the proposed solution approaches by reporting results from experimental tests performed on large size instances. [1 ] K. Gao, Y. Huang, Ali Sadollah, and L. Wang. A review of energy-efficient scheduling in intelligent production systems. Complex Intell. Syst., 6:237-249, 2020. [2 ] K. Train and G. Mehrez. Optional time-of-use prices for electricity: Econometric analysis of surplus and pareto impacts. RAND J. Econ., 25:263-283, 1994. [3 ] D. Anghinolfi, M. Paolucci, and R. Ronco. A bi-objective heuristic approach for green identical parallel machine scheduling. Eur. J. Oper. Res., 289(2):416-434, 2021

    A Computational Journey in Job Scheduling with Time-of-Use Costs

    No full text
    We present recent advances on both exact and heuristic algorithms for the bi-objective identical parallel machine scheduling with time-of-use costs problem. This problem belongs to the field of energy-efficient scheduling, which has received large attention during the last years in the literature on sustainable manufacturing. As a novel contribution, we investigate how multi-threaded computation is able to improve the performances of the current state-of-the-art approaches over a set of problem instances characterized by different sizes, ranging from small to large
    corecore