Note on "Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time"

Authors:
Suh-Jenq Yang;Chou-Jung Hsu;Dar-Li Yang
Affiliations:
Department of Industrial Management, Nan Kai University of Technology, Nan Tou 542, Taiwan;Department of Industrial Management, Nan Kai University of Technology, Nan Tou 542, Taiwan;Department of Information Management, National Formosa University, Yun Lin 632, Taiwan
Venue:
Information Sciences: an International Journal
Year:
2014

Citing 4
Cited 0

Discrete mathematics for computer scientists & mathematicians (2nd ed.)

Discrete mathematics for computer scientists & mathematicians (2nd ed.)
Scheduling Algorithms

Scheduling Algorithms
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

This note shows that the problem studied by Hsu et al. (2011) [2] can be solved in O(n^m^+^3) time even though the rate-modifying rate is larger than 1, where m is the number of machines and n is the number of jobs.