×

Found 91 Documents (Results 1–91)

Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times. (English) Zbl 1344.90020

Goldengorin, Boris I. (ed.) et al., Models, algorithms, and technologies for network analysis. Proceedings of the second international conference on network analysis, Nizhny Novgorod, Russia, May 7–9, 2012. New York, NY: Springer (ISBN 978-1-4614-8587-2/hbk; 978-1-4614-8588-9/ebook). Springer Proceedings in Mathematics & Statistics 59, 11-27 (2013).
MSC:  90B35
PDFBibTeX XMLCite
Full Text: DOI

A unified approach to approximating resource allocation and scheduling. (English) Zbl 1296.68023

Proceedings of the thirty-second annual ACM symposium on theory of computing (STOC 2000), Portland, Oregon, USA, May 21–23, 2000. New York, NY: ACM Press (ISBN 1-58113-184-4). 735-744 (2000).
MSC:  68M20 68W25
PDFBibTeX XMLCite
Full Text: DOI

A new lower bound for the makespan of a single machine scheduling problem. (English) Zbl 0831.90077

Kall, Peter (ed.), System modelling and optimization. Proceedings of the 15th IFIP conference, Zurich, Switzerland, September 2-6, 1991. Berlin: Springer-Verlag. Lect. Notes Control Inf. Sci. 180, 209-218 (1992).
MSC:  90B35
PDFBibTeX XMLCite

A cutting plane algorithm for the single machine scheduling problem with release times. (English) Zbl 0768.90040

Combinatorial optimization. New frontiers in theory and practice, Proc. NATO ASI, Ankara/Turkey 1990, NATO ASI Ser., Ser. F 82, 63-83 (1992).
MSC:  90B35 90C11 90-08
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software