Unknown

Dataset Information

0

A mathematical formulation and an NSGA-II algorithm for minimizing the makespan and energy cost under time-of-use electricity price in an unrelated parallel machine scheduling.


ABSTRACT: In many countries, there is an energy pricing policy that varies according to the time-of-use. In this context, it is financially advantageous for the industries to plan their production considering this policy. This article introduces a new bi-objective unrelated parallel machine scheduling problem with sequence-dependent setup times, in which the objectives are to minimize the makespan and the total energy cost. We propose a mixed-integer linear programming formulation based on the weighted sum method to obtain the Pareto front. We also developed an NSGA-II method to address large instances of the problem since the formulation cannot solve it in an acceptable computational time for decision-making. The results showed that the proposed NSGA-II is able to find a good approximation for the Pareto front when compared with the weighted sum method in small instances. Besides, in large instances, NSGA-II outperforms, with 95% confidence level, the MOGA and NSGA-I multi-objective techniques concerning the hypervolume and hierarchical cluster counting metrics. Thus, the proposed algorithm finds non-dominated solutions with good convergence, diversity, uniformity, and amplitude.

SUBMITTER: Rego MF 

PROVIDER: S-EPMC9044217 | biostudies-literature | 2022

REPOSITORIES: biostudies-literature

altmetric image

Publications

A mathematical formulation and an NSGA-II algorithm for minimizing the makespan and energy cost under time-of-use electricity price in an unrelated parallel machine scheduling.

Rego Marcelo F MF   Pinto Júlio Cesar E M JCEM   Cota Luciano P LP   Souza Marcone J F MJF  

PeerJ. Computer science 20220203


In many countries, there is an energy pricing policy that varies according to the time-of-use. In this context, it is financially advantageous for the industries to plan their production considering this policy. This article introduces a new bi-objective unrelated parallel machine scheduling problem with sequence-dependent setup times, in which the objectives are to minimize the makespan and the total energy cost. We propose a mixed-integer linear programming formulation based on the weighted su  ...[more]

Similar Datasets

| S-EPMC10306235 | biostudies-literature
| S-EPMC9634804 | biostudies-literature
| S-EPMC9693072 | biostudies-literature
| S-EPMC11856465 | biostudies-literature
| S-EPMC10445833 | biostudies-literature
| S-EPMC6057466 | biostudies-literature
| S-EPMC10792232 | biostudies-literature
| S-EPMC10907703 | biostudies-literature
| S-EPMC5481227 | biostudies-literature
| S-EPMC9032283 | biostudies-literature