Abstract
We study an online-list scheduling problem on a set of m multipurpose machines for which the objective is to minimize the makespan. It is assumed that there are two different job types, and each job type can be processed on a unique subset of machines. We provide an online algorithm with a competitive ratio of 1+k(m-1)/(k(m-s)+s2) where M1={ M1,.,Mk} is the set of machines eligible to process jobs of type 1 and where M2={Ms+1,.,Mm} is the set of machines eligible to process jobs of type 2 with k≥s. By analyzing the competitive ratio function, we show that the worst competitive ratio is obtained for an inclusive processing set structure in which the number of machines (m) is even, the first job type can be processed on any of the m machines and the second job type can be processed only on a subset of m/2 machines. Moreover, we provide a lower bound as a function of the processing set structure.
| Original language | English |
|---|---|
| Pages (from-to) | 155-162 |
| Number of pages | 8 |
| Journal | International Journal of Production Economics |
| Volume | 150 |
| DOIs | |
| State | Published - Apr 2014 |
| Externally published | Yes |
Bibliographical note
Funding Information:This research was partially supported by the Paul Ivanier Center for Robotics and Production Management, Ben-Gurion University of the Negev .
Funding
This research was partially supported by the Paul Ivanier Center for Robotics and Production Management, Ben-Gurion University of the Negev .
| Funders | Funder number |
|---|---|
| Ben-Gurion University of the Negev |
Keywords
- Competitive ratio
- Eligibility constraint
- Multipurpose machine scheduling
- Online scheduling