Journal of Scheduling, Volume 7
Volume 7, Number 1, January 2004
- Laura Barbulescu, Jean-Paul Watson, L. Darrell Whitley, Adele E. Howe: Scheduling Space-Ground Communications for the Air Force Satellite Control Network. 7-34
- Klaus Jansen, Lorant Porkolab: Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. 35-48
- 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
- Han Hoogeveen: Book Review. 93-94
Volume 7, Number 2, March 2004
- SCHARM'01: Selected Papers from the 2nd Philips Research Workshop on Scheduling and Resource Management. 103-104
- Clemens C. Wüst, Wim F. J. Verhaegh: Quality Control for Scalable Media Processing Applications. 105-117
- 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
- Reinder J. Bril, Elisabeth F. M. Steffens, Wim F. J. Verhaegh: Best-Case Response Times and Jitter Analysis of Real-Time Tasks. 133-147
- Sai Shankar N.: A New Contention Resolution Procedure for HFC Access Networks and its Performance Evaluation. 149-167
Volume 7, Number 3, May 2004
- Editorial. 169
- Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman: Approximation Algorithms for Average Stretch Scheduling. 195-222
- Thomas Erlebach, Alexander Hall: NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. 223-241
- Sandy Irani, Xiangwen Lu, Amelia Regan: On-Line Algorithms for the Dynamic Traveling Repair Problem. 243-258
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
- Gary W. Black, Kenneth N. McKay, Sherri L. Messimer: Predictive, Stochastic and Dynamic Extensions to Aversion Dynamics Scheduling. 277-292
- Hiroyuki Miyazawa, Thomas Erlebach: An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. 293-311
- Zhaohui Liu, T. C. Edwin Cheng: Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties. 313-327
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
- Peter Damaschke: Scheduling Search Procedures. 349-364
- H. Neil Geismar, Milind Dawande, Chelliah Sriskandarajah: Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells. 375-395
- Dirk C. Mattfeld: Conference Diary. 397-399
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
- Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza: The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. 421-428
- Vincent T'Kindt, Federico Della Croce, Carl Esswein: Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. 429-440
- Edmund K. Burke, Patrick De Causmaecker, Greet Vanden Berghe, Hendrik Van Landeghem: The State of the Art of Nurse Rostering. 441-499
- Erik Demeulemeester: Book Review/Project Scheduling with Time Windows and Scarce Resources by Klaus Neumann, Christoph Schwindt and Jürgen Zimmermann. 501-502
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team