default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 12
Volume 12, Number 1, February 2009
- Edmund K. Burke
, Michael L. Pinedo, Steef L. van de Velde:
Editorial. 1-2 - Gabriella Stecco, Jean-François Cordeau, Elena Moretti:
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine. 3-16 - Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz, Dennis Huisman:
A comparison of five heuristics for the multiple depot vehicle scheduling problem. 17-30 - Zhenbo Wang, Wenxun Xing, Bo Chen:
On-line service scheduling. 31-43 - Alessandro Agnetis, Paolo Detti, Marco Pranzo, Manbir Singh Sodhi:
Sequencing unreliable jobs on parallel machines. 45-54 - Rong 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. 55-89 - Ruyan Fu, Ji Tian, Jinjiang Yuan:
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. 91-97
Volume 12, Number 2, April 2009
- Gareth Beddoe, Sanja Petrovic, Jingpeng Li:
A hybrid metaheuristic case-based reasoning system for nurse rostering. 99-119 - Chun Yew Cheong, Kay Chen Tan, Bharadwaj Veeravalli:
A multi-objective evolutionary algorithm for examination timetabling. 121-146 - Jeroen Beliën, Erik Demeulemeester, Brecht Cardoen:
A decision support system for cyclic master surgery scheduling with multiple objectives. 147-161 - Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson:
A branch, bound, and remember algorithm for the 1| r i | Sigma t i scheduling problem. 163-175 - Theodore Birbas, Sophia Daskalaki, Efthymios Housos:
School timetabling for quality student and teacher schedules. 177-197 - Guy Even, Magnús M. Halldórsson, Lotem Kaplan, Dana Ron:
Scheduling with conflicts: online and offline algorithms. 199-224
Volume 12, Number 3, June 2009
- Rong Qu, Maria Fox, Derek Long:
Editorial for AI planning and scheduling. 225-226 - Antonio Garrido, Marlene Arangú, Eva Onaindia:
A constraint programming formulation for planning: from plan scheduling to plan generation. 227-256 - Jonathan F. Bard, Narameth Nananukul:
The integrated production-inventory-distribution-routing problem. 257-280 - Haitao Li, Keith Womer:
Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm. 281-298 - Nicola Policella, Amedeo Cesta, Angelo Oddi, Stephen F. Smith:
Solve-and-robustify. 299-314 - Julien Bidot, Thierry Vidal, Philippe Laborie, J. Christopher Beck:
A theoretic and practical framework for scheduling in a stochastic environment. 315-344
Volume 12, Number 4, August 2009
- Christian Bierwirth, Frank Meisel:
A fast heuristic for quay crane scheduling with interference constraints. 345-360 - Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch:
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem. 361-374 - Xiaoqiang Cai, Xianyi Wu, Xian Zhou:
Stochastic scheduling on parallel machines to minimize discounted holding costs. 375-388 - Claire Hanen, Yakov Zinder:
The worst-case analysis of the Garey-Johnson algorithm. 389-400 - Alessandro Agnetis, Gianluca de Pascale, Dario Pacciarelli:
A Lagrangian approach to single-machine scheduling problems with two competing agents. 401-415 - Djamila Ouelhadj, Sanja Petrovic:
A survey of dynamic scheduling in manufacturing systems. 417-431 - Eugene Levner:
J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, J. Weglarz: Handbook on scheduling: from theory to applications. 433-434
Volume 12, Number 5, October 2009
- Ceyda Oguz, Kirk Pruhs:
Editorial. 435-436 - Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia:
On truthfulness and approximation for scheduling selfish tasks. 437-445 - Christian Artigues, Cyril Briand:
The resource-constrained activity insertion problem with minimum and maximum time lags. 447-460 - Eyjolfur Ingi Asgeirsson, Cliff Stein:
Bounded-space online bin cover. 461-474 - Peter Brucker, Natalia V. Shakhlevich:
Inverse scheduling with maximum lateness objective. 475-488 - David P. Bunde:
Power-aware scheduling for makespan and flow. 489-500 - Marek Chrobak, Mathilde Hurand, Jirí Sgall:
Algorithms for testing fault-tolerance of sequenced jobs. 501-515 - Tomás Ebenlendr, Jirí Sgall:
Optimal and online preemptive scheduling on uniformly related machines. 517-527 - Carlo Filippi, Giorgio Romanin-Jacur:
Exact and approximate algorithms for high-multiplicity parallel machine scheduling. 529-541 - Stanislaw Gawiejnowicz, Wieslaw Kurc, Lidia Pankowska:
Conjugate problems in time-dependent scheduling. 543-553 - Matthias Müller-Hannemann, Alexander Sonnikow:
Non-approximability of just-in-time scheduling. 555-562
Volume 12, Number 6, December 2009
- Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd:
Preface. 563-564 - George Steiner, Rui Zhang:
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains. 565-574 - Shunji Tanaka, Shuji Fujikuma, Mituhiko Araki:
An exact algorithm for single-machine scheduling without machine idle time. 575-593 - Norbert Trautmann, Christoph Schwindt:
A cyclic approach to large-scale short-term planning in chemical batch production. 595-606 - Rafael A. Melo, Sebastián Urrutia, Celso C. Ribeiro:
The traveling tournament problem with predefined venues. 607-622
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-12 23:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
