External Links

    Journal: J. Scheduling

    Volume 7, Issue 6

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

    Volume 7, Issue 5

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

    Volume 7, Issue 4

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

    Volume 7, Issue 3

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

    Volume 7, Issue 2

    105 -- 117Clemens C. Wüst, Wim F. J. Verhaegh. Quality Control for Scalable Media Processing Applications
    119 -- 131Edgar den Boef, Wim F. J. Verhaegh, Jan H. M. Korst. Bus and Buffer Usage in In-Home Digital Networks: Applying the Dantzig-Wolfe Decomposition
    133 -- 147Reinder J. Bril, Elisabeth F. M. Steffens, Wim F. J. Verhaegh. Best-Case Response Times and Jitter Analysis of Real-Time Tasks
    149 -- 167N. Sai Shankar. A New Contention Resolution Procedure for HFC Access Networks and its Performance Evaluation

    Volume 7, Issue 1

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