Semi-online scheduling with GoS eligibility constraints

• Published in: International journal of production economics Vol. 153; pp. 204 - 214
• Main Authors: Lee, Kangbok, Hwang, Hark-Chin, Lim, Kyungkuk
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.07.2014; Elsevier Sequoia S.A
• Subjects: Algorithms; Competitive ratio; Economics; Grade of Service (GoS); Job shops; Lower bound example; Lower bounds; Mathematical problems; Operations research; Optimization; Optimization algorithms; Production scheduling; Scheduling; Scheduling algorithms; Semi-online scheduling; Studies; Unified algorithm; Unified algorithm; Grade of Service (GoS); Lower bound example; Semi-online scheduling; Competitive ratio
• ISSN: 0925-5273; 1873-7579
• DOI: 10.1016/j.ijpe.2014.03.001

We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest processing times and (4) the known optimal makespan. For semi-online problems with different numbers of machines and information, we present a unified algorithm. Then we provide lower bounds of the competitive ratio for any algorithm and prove the competitive ratio of the proposed algorithm.