Journal of Scheduling, Volume 7

Volume 7, Number 1, January 2004

• Edmund K. Burke, Michael Pinedo, Steef L. van de Velde:
  Editorial. 5-5
  Electronic Edition (link) BibTeX
• Laura Barbulescu, Jean-Paul Watson, L. Darrell Whitley, Adele E. Howe:
  Scheduling Space-Ground Communications for the Air Force Satellite Control Network. 7-34
  Electronic Edition (link) BibTeX
• Klaus Jansen, Lorant Porkolab:
  Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. 35-48
  Electronic Edition (link) BibTeX
• Nicholas G. Hall, Marc E. Posner:
  Sensitivity Analysis for Scheduling Problems. 49-83
  Electronic Edition (link) BibTeX
• Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos:
  Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. 85-91
  Electronic Edition (link) BibTeX
• Han Hoogeveen:
  Book Review. 93-94
  Electronic Edition (link) BibTeX

Volume 7, Number 2, March 2004

• SCHARM'01: Selected Papers from the 2nd Philips Research Workshop on Scheduling and Resource Management. 103-104
  Electronic Edition (link) BibTeX
• Clemens C. Wüst, Wim F. J. Verhaegh:
  Quality Control for Scalable Media Processing Applications. 105-117
  Electronic Edition (link) BibTeX
• Edgar den Boef, Wim F. J. Verhaegh, Jan H. M. Korst:
  Bus and Buffer Usage in In-Home Digital Networks: Applying the Dantzig-Wolfe Decomposition. 119-131
  Electronic Edition (link) BibTeX
• Reinder J. Bril, Elisabeth F. M. Steffens, Wim F. J. Verhaegh:
  Best-Case Response Times and Jitter Analysis of Real-Time Tasks. 133-147
  Electronic Edition (link) BibTeX
• N. Sai Shankar:
  A New Contention Resolution Procedure for HFC Access Networks and its Performance Evaluation. 149-167
  Electronic Edition (link) BibTeX

Volume 7, Number 3, May 2004

• Editorial. 169
  Electronic Edition (link) BibTeX
• Matthew Andrews, Lisa Zhang:
  Scheduling Protocols for Switches with Large Envelopes. 171-186
  Electronic Edition (link) BibTeX
• Sanjeev Arora, Bo Brinkman:
  A Randomized Online Algorithm for Bandwidth Utilization. 187-194
  Electronic Edition (link) BibTeX
• Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
  Approximation Algorithms for Average Stretch Scheduling. 195-222
  Electronic Edition (link) BibTeX
• Thomas Erlebach, Alexander Hall:
  NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. 223-241
  Electronic Edition (link) BibTeX
• Sandy Irani, Xiangwen Lu, Amelia Regan:
  On-Line Algorithms for the Dynamic Traveling Repair Problem. 243-258
  Electronic Edition (link) BibTeX

Volume 7, Number 4, July 2004

• John J. Kanet, Xiaoming Li:
  A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness. 261-276
  Electronic Edition (link) BibTeX
• Gary W. Black, Kenneth N. McKay, Sherri L. Messimer:
  Predictive, Stochastic and Dynamic Extensions to Aversion Dynamics Scheduling. 277-292
  Electronic Edition (link) BibTeX
• Hiroyuki Miyazawa, Thomas Erlebach:
  An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. 293-311
  Electronic Edition (link) BibTeX
• Zhaohui Liu, T. C. Edwin Cheng:
  Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties. 313-327
  Electronic Edition (link) BibTeX

Volume 7, Number 5, September 2004

• Wenci Yu, Han Hoogeveen, Jan Karel Lenstra:
  Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. 333-348
  Electronic Edition (link) BibTeX
• Peter Damaschke:
  Scheduling Search Procedures. 349-364
  Electronic Edition (link) BibTeX
• Ari Freund, Joseph Naor:
  Approximating the Advertisement Placement Problem. 365-374
  Electronic Edition (link) BibTeX
• H. Neil Geismar, Milind Dawande, Chelliah Sriskandarajah:
  Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells. 375-395
  Electronic Edition (link) BibTeX
• Dirk C. Mattfeld:
  Conference Diary. 397-399
  Electronic Edition (link) BibTeX

Volume 7, Number 6, November 2004

• Stéphane Dauzère-Pérès, Marc Sevaux:
  An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling. 405-420
  Electronic Edition (link) BibTeX
• Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza:
  The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. 421-428
  Electronic Edition (link) BibTeX
• Vincent T'Kindt, Federico Della Croce, Carl Esswein:
  Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. 429-440
  Electronic Edition (link) BibTeX
• Edmund K. Burke, Patrick De Causmaecker, Greet Vanden Berghe, Hendrik Van Landeghem:
  The State of the Art of Nurse Rostering. 441-499
  Electronic Edition (link) BibTeX
• Erik Demeulemeester:
  Book Review/Project Scheduling with Time Windows and Scarce Resources by Klaus Neumann, Christoph Schwindt and Jürgen Zimmermann. 501-502
  Electronic Edition (link) BibTeX