We investigate the max flow time scheduling problem in the off-line and on-line setting. We prove positive and negative theoretical results. In the off-line setting, we address the unrelated parallel machines model and present the first known fully polynomial time approximation scheme, when the number of machines is fixed. In the on-line setting and when the machines are identical, we analyze t...

This study deals with an unrelated parallel machine scheduling problem additional resources (UPMR). That is one of the important sub-problems in scheduling. UPMR consists a set jobs on machines. In addition to that, number or more are needed. very and its importance comes from wealth applications; they applicable engineering scientific situations manufacturing systems such as industrial robots,...

Abstract In many applications in the context of patient appointment scheduling there are recurring tasks with fixed delays between them. These commonly referred to as coupled-task jobs. settings, each job consists two whereby second task must start processing after an exact time lag following completion first task. this paper, we introduce problem a set jobs on parallel identical machines objec...