Epstein, Leah Parallel solutions for preemptive makespan scheduling on two identical machines. (English) Zbl 1517.90043 J. Sched. 26, No. 1, 61-76 (2023). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{L. Epstein}, J. Sched. 26, No. 1, 61--76 (2023; Zbl 1517.90043) Full Text: DOI arXiv
Epstein, Leah A survey on makespan minimization in semi-online environments. (English) Zbl 1406.90041 J. Sched. 21, No. 3, 269-284 (2018). MSC: 90B35 68M20 68W27 PDFBibTeX XMLCite \textit{L. Epstein}, J. Sched. 21, No. 3, 269--284 (2018; Zbl 1406.90041) Full Text: DOI
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S.; Levin, Asaf Online-bounded analysis. (English) Zbl 1406.90034 J. Sched. 21, No. 4, 429-441 (2018). MSC: 90B35 68M20 68W27 PDFBibTeX XMLCite \textit{J. Boyar} et al., J. Sched. 21, No. 4, 429--441 (2018; Zbl 1406.90034) Full Text: DOI Link
Böhm, Martin; Sgall, Jiří; van Stee, Rob; Veselý, Pavel Online bin stretching with three bins. (English) Zbl 1390.90307 J. Sched. 20, No. 6, 601-621 (2017). MSC: 90B35 68M20 90B06 68W27 PDFBibTeX XMLCite \textit{M. Böhm} et al., J. Sched. 20, No. 6, 601--621 (2017; Zbl 1390.90307) Full Text: DOI arXiv
Kellerer, Hans; Kotov, Vladimir; Gabay, Michaël An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. (English) Zbl 1333.90045 J. Sched. 18, No. 6, 623-630 (2015). MSC: 90B35 68M20 68W27 PDFBibTeX XMLCite \textit{H. Kellerer} et al., J. Sched. 18, No. 6, 623--630 (2015; Zbl 1333.90045) Full Text: DOI
Lee, Kangbok; Lim, Kyungkuk Semi-online scheduling problems on a small number of machines. (English) Zbl 1297.90052 J. Sched. 16, No. 5, 461-477 (2013). MSC: 90B35 68M20 68W27 PDFBibTeX XMLCite \textit{K. Lee} and \textit{K. Lim}, J. Sched. 16, No. 5, 461--477 (2013; Zbl 1297.90052) Full Text: DOI
Lam, Tak-Wah; Lee, Lap-Kei; To, Isaac K. K.; Wong, Prudence W. H. Improved multi-processor scheduling for flow time and energy. (English) Zbl 1280.68074 J. Sched. 15, No. 1, 105-116 (2012). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{T.-W. Lam} et al., J. Sched. 15, No. 1, 105--116 (2012; Zbl 1280.68074) Full Text: DOI
Papakonstantinou, Periklis A.; Rackoff, Charles W. Characterizing sets of jobs that admit optimal greedy-like algorithms. (English) Zbl 1184.90176 J. Sched. 13, No. 2, 163-176 (2010). MSC: 90C60 90B35 68M20 90C39 PDFBibTeX XMLCite \textit{P. A. Papakonstantinou} and \textit{C. W. Rackoff}, J. Sched. 13, No. 2, 163--176 (2010; Zbl 1184.90176) Full Text: DOI
Li, Rongheng; Huang, Huei-Chuen List scheduling for jobs with arbitrary release times and similar lengths. (English) Zbl 1153.90428 J. Sched. 10, No. 6, 365-373 (2007). MSC: 90B35 PDFBibTeX XMLCite \textit{R. Li} and \textit{H.-C. Huang}, J. Sched. 10, No. 6, 365--373 (2007; Zbl 1153.90428) Full Text: DOI
Awerbuch, Baruch; Azar, Yossi; Regev, Oded Maximizing job benefits on-line. (English) Zbl 0995.90095 J. Sched. 4, No. 6, 287-296 (2001). MSC: 90C35 PDFBibTeX XMLCite \textit{B. Awerbuch} et al., J. Sched. 4, No. 6, 287--296 (2001; Zbl 0995.90095) Full Text: DOI