Improved semi-online makespan scheduling with a reordering buffer


We study semi-online scheduling with a reordering buffer for identical parallel machines. In this problem, jobs arrive one by one and the online algorithm is equipped with a buffer of limited size, which can be used to reorder the jobs when making scheduling decisions. When the buffer is full, one of the jobs in the buffer must be irrevocably assigned to a… (More)
DOI: 10.1016/j.ipl.2013.03.007


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics