Activities per year
Abstract
We study a problem of scheduling a set of n jobs with unit processing times on a set of m multipurpose machines in which the objective is to minimize the makespan. It is assumed that there are two different job types, where each job type can be processed on a unique subset of machines. We provide an optimal offline algorithm to solve the problem in constant time and an online algorithm with a competitive ratio that equals the lower bound. We show that the worst competitive ratio is obtained for an inclusive jobmachine structure in which the first job type can be processed on any of the m machines while the second job type can be processed only on a subset of m/2 machines. Moreover, we show that our online algorithm is 1competitive if the machines are not flexible, i.e., each machine can process only a single job type.
Original language  American English 

State  Published  2016 
Event  28th European Conference on Operational Research  Poznan, Poland Duration: 3 Jul 2016 → 6 Jul 2016 
Conference
Conference  28th European Conference on Operational Research 

Country/Territory  Poland 
City  Poznan, 
Period  3/07/16 → 6/07/16 
Fingerprint
Dive into the research topics of 'Online scheduling of two job types on a set of multipurpose machines with unit processing times'. Together they form a unique fingerprint.Activities
 1 Organizing a conference, workshop, ...

28th European Conference on Operational Research
Karhi, S. (Participation  Conference participant)
3 Jul 2016 → 6 Jul 2016Activity: Participating in or organizing an event › Organizing a conference, workshop, ...