Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Access"
DOI: 10.1109/access.2017.2735538
Abstract: 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.… read more here.
Keywords: uniform parallel; parallel machine; total resource; resource consumption ... See more keywords