Journal of Scheduling

Cover image for Journal of Scheduling

Special Issue: Approximation Algorithms: Part 2

November/December 2000

Volume 3, Issue 6

Pages 321–381

Issue edited by: Gerhard J. Woeginger

  1. Editorials

    1. Top of page
    2. Editorials
    3. Research Articles
    1. Special issue on approximation algorithms: part 2 (pages 321–322)

      Gerhard J. Woeginger

      Article first published online: 27 OCT 2000 | DOI: 10.1002/1099-1425(200011/12)3:6<321::AID-JOS51>3.0.CO;2-J

  2. Research Articles

    1. Top of page
    2. Editorials
    3. Research Articles
    1. A PTAS for the average weighted completion time problem on unrelated machines (pages 323–332)

      Foto Afrati, Evripidis Bampis, Claire Kenyon and Ioannis Milis

      Article first published online: 27 OCT 2000 | DOI: 10.1002/1099-1425(200011/12)3:6<323::AID-JOS52>3.0.CO;2-E

    2. Restarts can help in the on-line minimization of the maximum delivery time on a single machine (pages 333–341)

      Marjan van den Akker, Han Hoogeveen and Nodari Vakhania

      Article first published online: 27 OCT 2000 | DOI: 10.1002/1099-1425(200011/12)3:6<333::AID-JOS53>3.0.CO;2-8

    3. On-line scheduling revisited (pages 343–353)

      Rudolf Fleischer and Michaela Wahl

      Article first published online: 27 OCT 2000 | DOI: 10.1002/1099-1425(200011/12)3:6<343::AID-JOS54>3.0.CO;2-2

    4. On-line and off-line preemptive two-machine job shop scheduling (pages 355–364)

      Tracy Kimbrel and Jared Saia

      Article first published online: 27 OCT 2000 | DOI: 10.1002/1099-1425(200011/12)3:6<355::AID-JOS55>3.0.CO;2-V

    5. Off-line admission control for general scheduling problems (pages 365–381)

      Cynthia A. Phillips, R. N. Uma and Joel Wein

      Article first published online: 27 OCT 2000 | DOI: 10.1002/1099-1425(200011/12)3:6<365::AID-JOS56>3.0.CO;2-P

SEARCH

SEARCH BY CITATION