×

Found 17 Documents (Results 1–17)

On preemptive resource constrained scheduling: Polynomial-time approximation schemes. (English) Zbl 1049.90025

Cook, William J. (ed.) et al., Integer programming and combinatorial optimization. 9th international IPCO conference, Cambridge, MA, USA, May 27–29, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43676-6). Lect. Notes Comput. Sci. 2337, 329-349 (2002).
MSC:  90B35 90C27 90C59
PDFBibTeX XMLCite
Full Text: Link

On minimizing average weighted completion time: A PTAS for scheduling general multiprocessor tasks. (English) Zbl 0999.68024

Freivalds, Rūsiņš (ed.), Fundamentals of computation theory. 13th international symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2138, 495-507 (2001).
MSC:  68M20
PDFBibTeX XMLCite
Full Text: Link

On minimizing average weighted completion time of multiprocessor tasks with release dates. (English) Zbl 0986.68007

Orejas, Fernando (ed.) et al., Automata, languages and programming. 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2076, 875-886 (2001).
MSC:  68M20 68W25
PDFBibTeX XMLCite
Full Text: Link

Preemptive parallel task scheduling in \(O(n)+\text{poly}(m)\) time. (English) Zbl 1044.68522

Lee, D. T. (ed.) et al., Algorithms and computation. 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18–20, 2000. Proceedings. Berlin: Springer (ISBN 3-540-41255-7). Lect. Notes Comput. Sci. 1969, 398-409 (2000).
MSC:  68M20
PDFBibTeX XMLCite
Full Text: Link

Preemptive scheduling on dedicated processors: Applications of fractional graph coloring. (English) Zbl 0996.68504

Nielsen, Mogens (ed.) et al., Mathematical foundations of computer science 2000. 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1893, 446-455 (2000).
MSC:  68M20 05C85 90B35
PDFBibTeX XMLCite

Polynomial time approximation schemes for general multiprocessor job shop scheduling. (English) Zbl 0973.68015

Montanari, Ugo (ed.) et al., Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1853, 878-889 (2000).
MSC:  68M20 68W25 90B35
PDFBibTeX XMLCite

Improved approximation schemes for scheduling unrelated parallel machines. (English) Zbl 1345.90043

Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 408-417 (1999).
MSC:  90B35 68W25 90C59
PDFBibTeX XMLCite
Full Text: DOI

General multiprocessor task scheduling: approximate solutions in linear time. (English) Zbl 1063.68540

Dehne, Frank (ed.) et al., Algorithms and data structures. 6th international workshop, WADS’99, Vancouver, Canada, August 11–14, 1999. Proceedings. Berlin: Springer (ISBN 3-540-66279-0/pbk). Lecture Notes in Computer Science 1663, 110-121 (1999).
MSC:  68M20 68W25
PDFBibTeX XMLCite

Linear-time approximation schemes for scheduling malleable parallel tasks. (English) Zbl 0944.90028

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. 490-498 (1999).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field