External Links

    Journal: J. Scheduling

    Volume 8, Issue 6

    497 -- 514Pasquale Avella, Igor Vasil ev. A Computational Study of a Cutting Plane Algorithm for University Course Timetabling
    515 -- 527Xiaonan Li, Sigurdur Ólafsson. Discovering Dispatching Rules Using Data Mining
    529 -- 536Pawel Jan Kalczynski, Jerzy Kamburowski. Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem
    537 -- 542J. Yuan, W. P. Shang, Q. Feng. A note on the scheduling with two families of jobs
    543 -- 546Salah E. Elmaghraby. Mathematical Programming and Financial Objectives for Scheduling Projects
    547 -- 550Dirk C. Mattfeld. Conference Diary
    551 -- 552K. Subramani. Erratum: An Analysis of Totally Clairvoyant Scheduling

    Volume 8, Issue 5

    355 -- 386Joseph Y.-T. Leung, Haibing Li, Michael Pinedo. Order Scheduling in an Environment with Dedicated Resources in Parallel
    387 -- 426Milind Dawande, H. Neil Geismar, Suresh P. Sethi, Chelliah Sriskandarajah. Sequencing and Scheduling in Robotic Cells: Recent Developments
    427 -- 451Mark Heffernan, Kent D. Wilken. Data-Dependency Graph Transformations for Instruction Scheduling
    453 -- 460Shao Chin Sung, Milan Vlach. Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines
    461 -- 473Eric Sanlaville. Sensitivity bounds for machine scheduling with uncertain communication delays

    Volume 8, Issue 4

    279 -- 279Maciej Drozdowski, Denis Trystram. Editorial: Special issue on conference MAPSP 2003: Part II
    281 -- 294Evripidis Bampis, Alexander Kononov. Bicriteria approximation algorithms for scheduling problems with communications delays
    295 -- 302Wieslaw Kubiak. Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing
    303 -- 322Peter Brucker, Thomas Kampmeyer. Tabu Search Algorithms for Cyclic Machine Scheduling Problems
    323 -- 351Ceyda Oguz, Muhammet Fikret Ercan. A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

    Volume 8, Issue 3

    195 -- 196Maciej Drozdowski, Denis Trystram. Special Issue on Conference MAPSP 2003: Part I
    197 -- 210Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff. A Hard Dial-a-Ride Problem that is Easy on Average
    211 -- 231Ph. Mauguière, Jean-Charles Billaut, Jean-Louis Bouquard. New Single Machine and Job-Shop Scheduling Problems with Availability Constraints
    233 -- 253Natalia V. Shakhlevich, Vitaly A. Strusevich. Pre-Emptive Scheduling Problems with Controllable Processing Times
    255 -- 273Paolo Detti, Alessandro Agnetis, Gianfranco Ciaschetti. Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

    Volume 8, Issue 2

    113 -- 133K. Subramani. An Analysis of Totally Clairvoyant Scheduling
    135 -- 143Paulo Bárcia, J. Orestes Cerdeira. The ::::k::::-Track Assignment Problem on Partial Orders
    145 -- 159Eugeniusz Nowicki, Czeslaw Smutnicki. An Advanced Tabu Search Algorithm for the Job Shop Problem
    161 -- 177H. A. J. Crauwels, C. N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove. Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs
    179 -- 190Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis. Scheduling trees with large communication delays on two identical processors

    Volume 8, Issue 1

    5 -- 0Edmund K. Burke, Michael Pinedo, Steef L. van de Velde. Editorial
    7 -- 23Richard J. Wallace, Eugene C. Freuder. Supporting dispatchability in schedules with consumable resources
    25 -- 48George Steiner, Zhihui Xue. Scheduling in Reentrant Robotic Cells: Algorithms and Complexity
    49 -- 74Jaehwan Yang, Marc E. Posner. Scheduling Parallel Machines for the Customer Order Problem
    75 -- 96John W. Fowler, Bosun Kim, W. Matthew Carlyle, Esma Senturk Gel, Shwu-Min Horng. Evaluating solution sets of ::::a posteriori:::: solution techniques for bi-criteria combinatorial optimization problems
    97 -- 106Milind Dawande, Subodha Kumar, Chelliah Sriskandarajah. Scheduling Web Advertisements: A Note on the Minspace Problem
    runs on