The on-line multiprocessor scheduling problem with known sum of the tasks

DOI10.1023/B:JOSH.0000046074.03560.5dzbMath1154.90403OpenAlexW2049830471MaRDI QIDQ2464434

Zsolt Tuza, á. B. Nagy, Maria Grazia Speranza, Enrico Angelelli

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:josh.0000046074.03560.5d

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on makespan minimization in semi-online environments, Online makespan minimization with parallel schedules, Semi on-line scheduling on three processors with known sum of the tasks, Tight upper bounds for semi-online scheduling on two uniform machines with known optimum, Semi-online scheduling: a survey, Semi-online scheduling problems on two identical machines with inexact partial information, Semi-online scheduling problems on a small number of machines, Bin stretching with migration on two hierarchical machines, An efficient algorithm for semi-online multiprocessor scheduling with given total processing time, Semi-online scheduling revisited, An efficient algorithm for bin stretching, Semi-online scheduling with ``end of sequence information, Online bin stretching with bunch techniques, Online scheduling with a buffer on related machines, Two semi-online scheduling problems on two uniform machines, An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time