Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints

2008 ◽  
Vol 40 (5-6) ◽  
pp. 572-581 ◽  
Author(s):  
Ling-Huey Su
Keyword(s):  
Completion Time ◽  
Parallel Machines ◽  
Total Completion Time ◽  
Identical Parallel Machines ◽  
Machine Eligibility

SEMI-ONLINE MACHINE COVERING

2007 ◽  
Vol 24 (03) ◽  
pp. 373-382 ◽  
Author(s):  
SHENG-YI CAI
Keyword(s):  
Competitive Ratio ◽  
Completion Time ◽  
Online Algorithm ◽  
Parallel Machines ◽  
Identical Parallel Machines ◽  
Processing Times ◽  
First Case ◽  
Machine Covering

This paper investigates two different semi-online versions of the machine covering, which is the problem of assigning a set of jobs to a system of m(m ≥ 3) identical parallel machines so as to maximize the earliest machine completion time. In the first case, we assume that the largest processing times is known in advance. In the second case, we assume that the total processing times of all jobs is known in advance. For each version we propose a semi-online algorithm and investigate its competitive ratio. The competitive ratio of each algorithm is [Formula: see text], which is shown to be the best possible competitive ratio for each semi-online problem.

scholarly journals Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines

2017 ◽  
Vol 31 (1) ◽  
pp. 101-123 ◽  
Author(s):  
Leah Epstein ◽  
Asaf Levin ◽  
Alan J. Soper ◽  
Vitaly A. Strusevich
Keyword(s):  
Completion Time ◽  
Parallel Machines ◽  
Total Completion Time
Sign in / Sign up

Export Citation Format

Share Document