Algorithms for Minimizing Resource Consumption Over Multiple Machines With a Common Due Window

Algorithms for Minimizing Resource Consumption Over Multiple Machines With a Common Due Window

Scheduling on multiple machines has attracted considerable attention recently. However, most of traditional studies focused only on commercial cost and customer satisfaction. In fact, we are able to alleviate environmental damages via proper scheduling. This study explores a multi-machine scheduling...

Full description

Bibliographic Details
Main Author: Jen-Ya Wang
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Chemical industry
multi-machine scheduling
resource consumption
due window
imperialist competitive algorithm
branch-and-bound algorithm
Online Access:https://ieeexplore.ieee.org/document/8917637/

Internet

https://ieeexplore.ieee.org/document/8917637/

Similar Items