Cited By
View all- Epstein L(2018)A survey on makespan minimization in semi-online environmentsJournal of Scheduling10.1007/s10951-018-0567-z21:3(269-284)Online publication date: 24-Dec-2018
In this paper we consider several semi-online scheduling problems on two identical machines with combined information. The objective of each problem is to minimize the makespan. The first problem is semi-online scheduling with known optimal solution ...
In this paper we consider the semi-online scheduling problem with known partial information about job sizes on two identical machines, where all the jobs have processing times in the interval [p,tp](p>0,t>=1) and the maximum job size is tp. The ...
In this paper, we study a scheduling problem on identical parallel machines, in which a processing time and a due date are given for each job, and the objective is to maximize the number of just-in-time jobs. A job is called just-in-time if it is ...
Springer-Verlag
Berlin, Heidelberg