Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan

Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan

This paper examines the uniform parallel-machine scheduling problem in which the objective aims to minimize the total resource consumption (TRC) with a bounded makespan. A matheuristic is proposed to deal with this strongly NP-hard problem. The performance of the proposed matheuristic is compared wi...

Full description

Bibliographic Details
Main Authors: Shih-Wei Lin, Kuo-Ching Ying
Format: Article
Language:English
Published: IEEE 2017-01-01
Series:IEEE Access
Subjects:
Operations research
scheduling algorithm
parallel machines
total resource consumption
Online Access:https://ieeexplore.ieee.org/document/8000570/

Internet

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

Similar Items