학술논문
Semi-online scheduling problems on m parallel identical machines
Document Type
Conference
Author
Source
2011 6th IEEE Joint International Information Technology and Artificial Intelligence Conference Information Technology and Artificial Intelligence Conference (ITAIC), 2011 6th IEEE Joint International. 1:289-291 Aug, 2011
Subject
Language
Abstract
This paper investigates the semi-online scheduling problems on m parallel identical machines with non-simultaneous machine available times. The objective is to maximize the minimum machine completion time. For the semi-online version with jobs arrived in non-increasing processing time order, LS is showed an optimal algorithm for three and four machines cases and the lower bound 10/7 is presented when m is greater than or equal to five.