Abstract
In this paper, we investigate a semi on-line version of the parallel machine scheduling problem. We are given a buffer of length k which is available to maintain k jobs. The jobs arrive one by one and can be temporarily assigned to the buffer if the buffer is not full. The goal is to assign all jobs to the identical machines such that the makespan is minimized. For two machines, Kellerer et al. (1995) showed that no heuristic for this problem can have a worst-case ratio lower than 4 3 . This paper presents a simple algorithm with worst-case ratio 4 3 for P2// C max with a buffer of length 1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
