Unrelated parallel-machine scheduling problems with multiple rate-modifying activities

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

Citing 4
Cited 0

Parallel-machine scheduling with time dependent processing times

Theoretical Computer Science
Parallel-machine scheduling of simple linear deteriorating jobs

Theoretical Computer Science
Scheduling with job-dependent learning effects and multiple rate-modifying activities

Information Processing Letters
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

In this article we investigate scheduling problems with multiple rate-modifying activities on an unrelated parallel-machine setting. We assume that each machine may have multiple rate-modifying activities. The goal is to determine jointly the optimal rate-modifying activity frequencies, the optimal rate-modifying activity positions, and the optimal schedule to minimize the total completion time and the total machine load, respectively. If the number of machines is fixed, we propose two efficient polynomial time algorithms for solving both problems no matter what the processing time of a job scheduled after a rate-modifying activity is greater or less than its processing time scheduled before the rate-modifying activity.