z-logo
open-access-imgOpen Access
Mathematical Models of Energy-Conscious Bi-Objective Unrelated Parallel Machine Scheduling
Author(s) -
Bobby Kurniawan
Publication year - 2020
Publication title -
jurnal teknik industri
Language(s) - English
Resource type - Journals
eISSN - 2527-4112
pISSN - 1978-1431
DOI - 10.22219/jtiumm.vol21.no2.115-125
Subject(s) - tardiness , mathematical optimization , scheduling (production processes) , energy consumption , computer science , industrialisation , job shop scheduling , renewable energy , operations research , environmental economics , economics , mathematics , engineering , embedded system , routing (electronic design automation) , electrical engineering , market economy
The industrialization has led to the prosperity of human life. However, it causes the side effect that harms the environment. Moreover, the source of energy used to drive the industrialization comes from non-renewable resources that can be extinct. As the extensive energy user, the manufacturing sector can use energy efficiently by scheduling and planning. A scheduling system that incorporates environmental and the energy consumption is one of the initiatives to reduce energy consumption and reduce environmental effects. Therefore, this study addresses bi-objective unrelated parallel machine scheduling to minimize the total tardiness and energy consumption. The energy consumption follows the Time-Of-Use (TOU) tariffs price scheme. The problem is formulated as two mixed-integer programming (MIP) models, using the time-indexed and disjunctive formulation, and solved using the weighted sum method. We perform complexity and computational analysis to evaluate the performance of models. Numerical experiments show that the time-indexed formulation is more efficient than the disjunctive formulation. The results provide useful insights for decision-makers in the manufacturing sectors to be energy-conscious without neglecting the production efficiency.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here