Activities per year
Abstract
In the majority of works on online scheduling on multipurpose machines the objective is to minimize the makespan. We, in contrast, consider the objective of minimizing the total completion time. For this purpose, we analyze an onlinelist scheduling problem of n jobs with unit processing times on a set of two machines working in parallel. Each job belongs to one of two sets of job types. Jobs belonging to the first set can be processed on either of the two machines while jobs belonging to the second set can only be processed on the second machine. We present an online algorithm with a competitive ratio of View the MathML source, where ρLB is a lower bound on the competitive ratio of any online algorithm and is equal to View the MathML source where View the MathML source. This result implies that our online algorithm is asymptotically optimal.
Original language  American English 

State  Published  2015 
Event  Industrial Engineering and Management Conference  TelAviv, Israel Duration: 24 Feb 2015 → 24 Feb 2015 
Conference
Conference  Industrial Engineering and Management Conference 

Country/Territory  Israel 
City  TelAviv 
Period  24/02/15 → 24/02/15 
Fingerprint
Dive into the research topics of 'An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times'. Together they form a unique fingerprint.Activities
 2 Organizing a conference, workshop, ...

Industrial Engineering and Management Conference
Karhi, S. (Participation  Conference participant)
24 Feb 2015Activity: Participating in or organizing an event › Organizing a conference, workshop, ...

Annual Conference of Operational Research Society of Israel (ORSIS)
Karhi, S. (Participation  Conference participant)
10 May 2015 → 11 May 2015Activity: Participating in or organizing an event › Organizing a conference, workshop, ...