External Links

    Journal: J. Scheduling

    Volume 12, Issue 6

    563 -- 564Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd. Preface
    565 -- 574George Steiner, Rui Zhang. Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
    575 -- 593Shunji Tanaka, Shuji Fujikuma, Mituhiko Araki. An exact algorithm for single-machine scheduling without machine idle time
    595 -- 606Norbert Trautmann, Christoph Schwindt. A cyclic approach to large-scale short-term planning in chemical batch production
    607 -- 622Rafael A. Melo, Sebastián Urrutia, Celso C. Ribeiro. The traveling tournament problem with predefined venues

    Volume 12, Issue 5

    435 -- 436Ceyda Oguz, Kirk Pruhs. Editorial
    437 -- 445Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia. On truthfulness and approximation for scheduling selfish tasks
    447 -- 460Christian Artigues, Cyril Briand. The resource-constrained activity insertion problem with minimum and maximum time lags
    461 -- 474Eyjolfur Ingi Asgeirsson, Cliff Stein. Bounded-space online bin cover
    475 -- 488Peter Brucker, Natalia V. Shakhlevich. Inverse scheduling with maximum lateness objective
    489 -- 500David P. Bunde. Power-aware scheduling for makespan and flow
    501 -- 515Marek Chrobak, Mathilde Hurand, Jiri Sgall. Algorithms for testing fault-tolerance of sequenced jobs
    517 -- 527Tomás Ebenlendr, Jiri Sgall. Optimal and online preemptive scheduling on uniformly related machines
    529 -- 541Carlo Filippi, Giorgio Romanin Jacur. Exact and approximate algorithms for high-multiplicity parallel machine scheduling
    543 -- 553Stanislaw Gawiejnowicz, Wieslaw Kurc, Lidia Pankowska. Conjugate problems in time-dependent scheduling
    555 -- 562Matthias Müller-Hannemann, Alexander Sonnikow. Non-approximability of just-in-time scheduling

    Volume 12, Issue 4

    345 -- 360Christian Bierwirth, Frank Meisel. A fast heuristic for quay crane scheduling with interference constraints
    361 -- 374Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch. Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem
    375 -- 388Xiaoqiang Cai, Xianyi Wu, Xian Zhou. Stochastic scheduling on parallel machines to minimize discounted holding costs
    389 -- 400Claire Hanen, Yakov Zinder. The worst-case analysis of the Garey-Johnson algorithm
    401 -- 415Alessandro Agnetis, Gianluca de Pascale, Dario Pacciarelli. A Lagrangian approach to single-machine scheduling problems with two competing agents
    417 -- 431Djamila Ouelhadj, Sanja Petrovic. A survey of dynamic scheduling in manufacturing systems
    433 -- 434Eugene Levner. J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, J. Weglarz: Handbook on scheduling: from theory to applications

    Volume 12, Issue 3

    225 -- 226Rong Qu, Maria Fox, Derek Long. Editorial for AI planning and scheduling
    227 -- 256Antonio Garrido, Marlene Arangú, Eva Onaindia. A constraint programming formulation for planning: from plan scheduling to plan generation
    257 -- 280Jonathan F. Bard, Narameth Nananukul. The integrated production-inventory-distribution-routing problem
    281 -- 298Haitao Li, Keith Womer. Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm
    299 -- 314Nicola Policella, Amedeo Cesta, Angelo Oddi, Stephen F. Smith. Solve-and-robustify
    315 -- 344Julien Bidot, Thierry Vidal, Philippe Laborie, J. Christopher Beck. A theoretic and practical framework for scheduling in a stochastic environment

    Volume 12, Issue 2

    99 -- 119Gareth Beddoe, Sanja Petrovic, Jingpeng Li. A hybrid metaheuristic case-based reasoning system for nurse rostering
    121 -- 146C. Y. Cheong, K. C. Tan, Bharadwaj Veeravalli. A multi-objective evolutionary algorithm for examination timetabling
    147 -- 161Jeroen Beliën, Erik Demeulemeester, Brecht Cardoen. A decision support system for cyclic master surgery scheduling with multiple objectives
    163 -- 175Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson. A branch, bound, and remember algorithm for the 1| ::::r:::: :: ::::i:::: ::| Sigma ::::t:::: :: ::::i:::: :: scheduling problem
    177 -- 197Theodore Birbas, Sophia Daskalaki, Efthymios Housos. School timetabling for quality student and teacher schedules
    199 -- 224Guy Even, Magnús M. Halldórsson, Lotem Kaplan, Dana Ron. Scheduling with conflicts: online and offline algorithms

    Volume 12, Issue 1

    1 -- 2Edmund K. Burke, Michael Pinedo, Steef L. van de Velde. Editorial
    3 -- 16Gabriella Stecco, Jean-François Cordeau, Elena Moretti. A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
    17 -- 30Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz, Dennis Huisman. A comparison of five heuristics for the multiple depot vehicle scheduling problem
    31 -- 43Zhenbo Wang, Wenxun Xing, Bo Chen. On-line service scheduling
    45 -- 54Alessandro Agnetis, Paolo Detti, Marco Pranzo, Manbir S. Sodhi. Sequencing unreliable jobs on parallel machines
    55 -- 89Rong Qu, Edmund K. Burke, Barry McCollum, Liam T. G. Merlot, S. Y. Lee. A survey of search methodologies and automated system development for examination timetabling
    91 -- 97Ruyan Fu, Ji Tian, Jinjiang Yuan. On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    runs on