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

Authors:
Chou-Jung Hsu;T. C. E. Cheng;Dar-Li Yang
Affiliations:
Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan
Venue:
Information Sciences: an International Journal
Year:
2011

Citing 15
Cited 9

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

Discrete mathematics for computer scientists & mathematicians (2nd ed.)
Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

Information Sciences: an International Journal
A note: Common due date assignment for a single machine scheduling with the rate-modifying activity

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Scheduling a maintenance activity and due-window assignment on a single machine

Computers and Operations Research
Some scheduling problems with general position-dependent and time-dependent learning effects

Information Sciences: an International Journal
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations

Information Sciences: an International Journal
Some single-machine and m-machine flowshop scheduling problems with learning considerations

Information Sciences: an International Journal
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Note on "Single-machine and flowshop scheduling with a general learning effect model" and "Some single-machine and m-machine flowshop scheduling problems with learning considerations"

Information Sciences: an International Journal
Scheduling problems with general effects of deterioration and learning

Information Sciences: an International Journal
Notes on "some single-machine scheduling problems with general position-dependent and time-dependent learning effects"

Information Sciences: an International Journal
A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity

Computers and Operations Research
Due-date assignment and maintenance activity scheduling problem

Mathematical and Computer Modelling: An International Journal

Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Information Sciences: an International Journal
Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments

Information Sciences: an International Journal
Multi-level hierarchic genetic-based scheduling of independent jobs in dynamic heterogeneous grid environment

Information Sciences: an International Journal
The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine

Information Sciences: an International Journal
Simultaneous batch splitting and scheduling on identical parallel production lines

Information Sciences: an International Journal
Unrelated parallel-machine scheduling problems with multiple rate-modifying activities

Information Sciences: an International Journal
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects

Computers and Operations Research
Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities

Information Sciences: an International Journal
Note on "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

Zhao et al. (2009) [24] study the m identical parallel-machine scheduling problem with rate-modifying activities to minimize the total completion time. They show that the problem can be solved in O(n^2^m^+^3) time. In this study we extend the scheduling environment to the unrelated parallel-machine setting and present a more efficient algorithm to solve the extended problem. For the cases where the rate-modifying rate is (i) larger than 0 and not larger than 1, and (ii) larger than 0, we show that the problem can be solved in O(n^m^+^3) and O(n^2^m^+^2) time, respectively.