z-logo
open-access-imgOpen Access
Discrete optimization model for permutation flow shop under time-of-use electricity tariffs
Author(s) -
Fang Wang,
QingJiang Pan,
Jing You
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1633/1/012146
Subject(s) - electricity , downtime , computer science , scheduling (production processes) , mathematical optimization , permutation (music) , software , real time computing , operations research , mathematics , engineering , physics , acoustics , electrical engineering , programming language , operating system
The time-of-use electricity tariffs (TOU) which is widely used at home and abroad make the timeline for scheduling to have the attribute of different electricity tariffs. In order to solve the difficulty of coordination between electricity price segmentation and product processing time, this paper proposes a discrete optimization model, which uses central moment method modelling to ensure the continuity of job-processing and the uniqueness of processing time points. A discrete optimization model with maximum completion time and total electricity cost is constructed. According to the instance of the processing workshop and the characteristics of GAMS software, a virtual small-scale case of detection is constructed. By setting 11 groups of experiments with different weights, the total electricity cost is reduced by 30% compared with the traditional scheduling scheme after the electricity cost optimization is considered to avoid the peak arrangement of the electricity price. Although the maximum completion time is increased by nearly 30% on the surface, the downtime of staggering the peak is removed, the actual processing time is 42 minutes, and the total completion time is only increased by 5%.

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