×

Found 101 Documents (Results 1–100)

On the complexity of scheduling problems with a fixed number of parallel identical machines. (English) Zbl 07726604

Gąsieniec, Leszek (ed.), SOFSEM 2023: theory and practice of computer science. 48th international conference on current trends in theory and practice of computer science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13878, 192-206 (2023).
MSC:  90B35 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Two-agent scheduling with resource augmentation on multiple machines. (English) Zbl 1512.68042

Cano, José (ed.) et al., Euro-Par 2022: parallel processing. 28th international conference on parallel and distributed computing, Glasgow, UK, August 22–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13440, 253-267 (2022).
MSC:  68M20 68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI

A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds. (English) Zbl 1497.90087

Aardal, Karen (ed.) et al., Integer programming and combinatorial optimization. 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13265, 237-250 (2022).
MSC:  90B35 68M20 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Malleable scheduling beyond identical machines. (English) Zbl 07650084

Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 17, 14 p. (2019).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem. (English) Zbl 1443.68222

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 28, 12 p. (2018).
MSC:  68W40 68P05 90B35
PDFBibTeX XMLCite
Full Text: DOI

An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. (English) Zbl 1248.90050

Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 238-248 (2009).
MSC:  90B35 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field