Open AccessUniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan
Author(s) -
Shih-Wei Lin,
Kuo-Ching Ying
Publication year - 2017
Publication title -
ieee access
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.587
H-Index - 127
ISSN - 2169-3536
DOI - 10.1109/access.2017.2735538
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
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 with that of the state-of-the-art particle swarm optimization (PSO) meta-heuristic and the lower bound (LB) of TRC on a set of benchmark instances. Computational results show that the proposed matheuristic significantly outperforms the PSO meta-heuristic and its solution is very close to the tight LB. Given the critical need for environmental protection, this paper provides an effective and efficient algorithm for diminishing the gap between the theoretical progress of scheduling and the practical need for environmental protection.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom