Jansen, Klaus; Porkolab, Lorant On preemptive resource constrained scheduling: Polynomial-time approximation schemes. (English) Zbl 1127.90028 SIAM J. Discrete Math. 20, No. 3, 545-563 (2006). MSC: 90B35 68W25 68W40 90C05 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, SIAM J. Discrete Math. 20, No. 3, 545--563 (2006; Zbl 1127.90028) Full Text: DOI
Jansen, Klaus; Porkolab, Lorant General multiprocessor task scheduling: Approximate solutions in linear time. (English) Zbl 1095.68010 SIAM J. Comput. 35, No. 3, 519-530 (2005). MSC: 68M20 68Q25 68W25 90B35 90C27 90C39 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, SIAM J. Comput. 35, No. 3, 519--530 (2005; Zbl 1095.68010) Full Text: DOI
Jansen, Klaus; Porkolab, Lorant Preemptive scheduling with dedicated processors: applications of fractional graph coloring. (English) Zbl 1306.90054 J. Sched. 7, No. 1, 35-48 (2004). MSC: 90B35 68M20 68R10 05C15 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, J. Sched. 7, No. 1, 35--48 (2004; Zbl 1306.90054) Full Text: DOI
Jansen, Klaus; Porkolab, Lorant Preemptive scheduling with dedicated processors: applications of fractional graph coloring. (English) Zbl 1154.90463 J. Sched. 6, No. 6, 35-48 (2003). MSC: 90B35 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, J. Sched. 6, No. 6, 35--48 (2003; Zbl 1154.90463) Full Text: DOI
Jansen, Klaus; Porkolab, Lorant Computing optimal preemptive schedules for parallel tasks: linear programming approaches. (English) Zbl 1023.90026 Math. Program. 95, No. 3 (A), 617-630 (2003). MSC: 90B35 90C05 68M20 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, Math. Program. 95, No. 3 (A), 617--630 (2003; Zbl 1023.90026) Full Text: DOI
Jansen, Klaus; Porkolab, Lorant 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 \textit{K. Jansen} and \textit{L. Porkolab}, Lect. Notes Comput. Sci. 2337, 329--349 (2002; Zbl 1049.90025) Full Text: Link
Jansen, Klaus; Porkolab, Lorant Polynomial time approximation schemes for general multiprocessor job shop scheduling. (English) Zbl 1036.68011 J. Algorithms 45, No. 2, 167-191 (2002). MSC: 68M20 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, J. Algorithms 45, No. 2, 167--191 (2002; Zbl 1036.68011) Full Text: DOI
Jansen, K.; Porkolab, L. Linear-Time approximation schemes for scheduling malleable parallel tasks. (English) Zbl 1009.68013 Algorithmica 32, No. 3, 507-520 (2002). MSC: 68M20 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, Algorithmica 32, No. 3, 507--520 (2002; Zbl 1009.68013) Full Text: DOI Link
Jansen, Klaus; Porkolab, Lorant Improved approximation schemes for scheduling unrelated parallel machines. (English) Zbl 1082.90525 Math. Oper. Res. 26, No. 2, 324-338 (2001). MSC: 90B35 68Q25 68W40 90C59 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, Math. Oper. Res. 26, No. 2, 324--338 (2001; Zbl 1082.90525) Full Text: DOI
Fishkin, Aleksei V.; Jansen, Klaus; Porkolab, Lorant 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 \textit{A. V. Fishkin} et al., Lect. Notes Comput. Sci. 2138, 495--507 (2001; Zbl 0999.68024) Full Text: Link
Fishkin, Aleksei V.; Jansen, Klaus; Porkolab, Lorant 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 \textit{A. V. Fishkin} et al., Lect. Notes Comput. Sci. 2076, 875--886 (2001; Zbl 0986.68007) Full Text: Link
Jansen, Klaus; Porkolab, Lorant 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 \textit{K. Jansen} and \textit{L. Porkolab}, Lect. Notes Comput. Sci. 1969, 398--409 (2000; Zbl 1044.68522) Full Text: Link
Jansen, Klaus; Porkolab, Lorant 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 \textit{K. Jansen} and \textit{L. Porkolab}, Lect. Notes Comput. Sci. 1893, 446--455 (2000; Zbl 0996.68504)
Jansen, Klaus; Porkolab, Lorant 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 \textit{K. Jansen} and \textit{L. Porkolab}, Lect. Notes Comput. Sci. 1853, 878--889 (2000; Zbl 0973.68015)
Jansen, Klaus; Porkolab, Lorant 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 \textit{K. Jansen} and \textit{L. Porkolab}, in: 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. 408--417 (1999; Zbl 1345.90043) Full Text: DOI
Jansen, Klaus; Porkolab, Lorant 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 \textit{K. Jansen} and \textit{L. Porkolab}, Lect. Notes Comput. Sci. 1663, 110--121 (1999; Zbl 1063.68540)
Jansen, Klaus; Porkolab, Lorant 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). MSC: 90B35 90C59 90C60 65Y05 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Porkolab}, in: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, SODA '99. Baltimore, MD, USA, January 17--19, 1999. Philadelphia, PA: SIAM. 490--498 (1999; Zbl 0944.90028)