default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Scheduling, Volume 14
Volume 14, Number 1, February 2011
- Patrick De Causmaecker
, Greet Vanden Berghe:
A categorisation of nurse rostering problems. 3-16 - Malte Fliedner, Nils Boysen, Armin Scholl:
On the part inventory model sequencing problem: complexity and Beam Search heuristic. 17-25 - Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Scheduling jobs with equal processing times subject to machine eligibility constraints. 27-38 - Jeffrey W. Herrmann:
Using aggregation to reduce response time variability in cyclic fair sequences. 39-55 - Leandro Magatão, Lúcia V. R. Arruda, Flávio Neves Jr.:
A combined CLP-MILP approach for scheduling commodities in a pipeline. 57-87 - Antoine Musitelli, Jean-Marc Nicoletti:
Competitive ratio of List Scheduling on uniform machines and randomized heuristics. 89-101 - Alix Munier Kordon:
A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule. 103-117 - Alistair R. Clark, Reinaldo Morabito, Eli A. V. Toso:
Erratum to: Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching. 119
Volume 14, Number 2, April 2011
- Ivan Heckman, J. Christopher Beck:
Understanding the behavior of Solution-Guided Search for job-shop scheduling. 121-140 - Michael Gatto, Peter Widmayer:
On robust online scheduling algorithms. 141-156 - Behzad Ashtiani, Roel Leus, Mir-Bahador Aryanezhad:
New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing. 157-171 - Xiaoqiang Cai, Xianyi Wu, Xian Zhou:
Scheduling deteriorating jobs on a single machine subject to breakdowns. 173-186 - Hana Rudová, Tomás Müller, Keith S. Murray:
Complex university course timetabling. 187-207 - António Aroso Menezes, Alistair R. Clark, Bernardo Almada-Lobo:
Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups. 209-219
Volume 14, Number 3, June 2011
- Jacek Blazewicz, Valter Boljuncic, Silvano Martello, Jadranka Skorin-Kapov:
Combinatorial optimization issues in scheduling. 221-223 - Alessandro Agnetis, Marta Flamini, Gaia Nicosia, Andrea Pacifici:
A job-shop problem with one additional resource type. 225-237 - Peter Brucker, Natalia V. Shakhlevich:
Inverse scheduling: two-machine flow-shop problem. 239-256 - Imed Kacem, Hans Kellerer:
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. 257-265 - Vladimir Kats, Eugene Levner:
Parametric algorithms for 2-cyclic robot scheduling with interval processing times. 267-279 - Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi:
On the one-dimensional stock cutting problem in the paper tube industry. 281-290 - Marek Mika, Grzegorz Waligóra, Jan Weglarz:
Modelling and solving grid resource allocation problem with network resources for workflow applications. 291-306
Volume 14, Number 4, August 2011
- Armin Fügenschuh:
A set partitioning reformulation of a school bus scheduling problem. 307-318 - Marta Mesquita, Margarida Moz, Ana Paias, José Pinto Paixão, Margarida Vaz Pato, Ana Respício:
A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters. 319-334 - Marvin Mandelbaum, Dvir Shabtay:
Scheduling unit length jobs on parallel machines with lookahead information. 335-350 - Hassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov:
Minimizing the number of late jobs on a single machine under due date uncertainty. 351-360 - Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng:
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. 361-369 - Peter Brucker, Natalia V. Shakhlevich:
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. 371-389 - Francisco Ballestín, Agustín Barrios, Vicente Valls:
An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags. 391-406
Volume 14, Number 5, October 2011
- Jacek Blazewicz, Maciej Drozdowski, Graham Kendall, Barry McCollum:
Preface. 407 - Jason A. D. Atkin, Edmund K. Burke, John S. Greenwood:
A comparison of two methods for reducing take-off delay at London Heathrow airport. 409-421 - Raymond S. K. Kwan:
Case studies of successful train crew scheduling optimisation. 423-434 - Svetlana A. Kravchenko, Frank Werner:
Parallel machine problems with equal processing times: a survey. 435-444 - Kenneth R. Baker, Dan Trietsch:
Three heuristic procedures for the stochastic, two-machine flow shop problem. 445-454 - Dvir Shabtay, George Steiner:
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. 455-469 - Donatas Elvikis, Horst W. Hamacher, Vincent T'kindt:
Scheduling two agents on uniform parallel machines with makespan and cost functions. 471-481 - Trung Hieu Tran, Kien Ming Ng:
A water-flow algorithm for flexible flow shop scheduling with intermediate buffers. 483-500 - Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. 501-509 - Abir Benabid, Claire Hanen:
Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays. 511-522
Volume 14, Number 6, December 2011
- Boris Detienne, Stéphane Dauzère-Pérès, Claude Yugma:
Scheduling jobs on parallel machines to minimize a regular step total cost function. 523-538 - Boris Detienne, Stéphane Dauzère-Pérès, Claude Yugma:
Erratum to: Scheduling jobs on parallel machines to minimize a regular step total cost function. 539-540 - Philippe Chrétienne, Öncü Hazir, Safia Kedad-Sidhoum:
Integrated batch sizing and scheduling on a single machine. 541-555 - Thorsten Gather, Jürgen Zimmermann, Jan-Hendrik Bartels:
Exact methods for the resource levelling problem. 557-569 - Uwe Schwiegelshohn:
A system-centric metric for the evaluation of online job schedules. 571-581 - Lars Mönch, John W. Fowler, Stéphane Dauzère-Pérès, Scott J. Mason, Oliver Rose:
A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. 583-599 - Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. 601-615 - Sadaf Naseem Jat, Shengxiang Yang:
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling. 617-637 - Abdullah Alsheddy, Edward P. K. Tsang:
Empowerment scheduling for a field workforce. 639-654 - Allison C. B. Guedes, Celso C. Ribeiro:
A heuristic for minimizing weighted carry-over effects in round robin tournaments. 655-667
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-09 23:25 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:
