| 285 | -- | 288 | Vicente Valls, Jan Weglarz. Project management and scheduling |
| 289 | -- | 306 | Willy Herroelen, Roel Leus. Project scheduling under uncertainty: Survey and research potentials |
| 307 | -- | 313 | Salah E. Elmaghraby. On the fallacy of averages in project risk management |
| 314 | -- | 328 | Christian Artigues, Jean-Charles Billaut, Carl Esswein. Maximization of solution flexibility for robust shop scheduling |
| 329 | -- | 338 | Anand Paul, Genaro Gutierrez. Simple probability models for project contracting |
| 339 | -- | 358 | Can Akkan, Andreas Drexl, Alf Kimms. Network decomposition-based benchmark results for the discrete time-cost tradeoff problem |
| 359 | -- | 374 | Mario Vanhoucke. New computational results for the discrete time/cost trade-off problem with time-switch constraints |
| 375 | -- | 386 | Vicente Valls, Francisco Ballestín, Sacramento Quintanilla. Justification and RCPSP: A technique that pays |
| 387 | -- | 397 | Sergey V. Sevastianov. An introduction to multi-parameter complexity analysis of discrete problems |
| 398 | -- | 407 | Peter Brucker, Sigrid Knust, Guoqing Wang. Complexity results for flow-shop problems with a single server |
| 408 | -- | 415 | Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner. The two-machine flow-shop problem with weighted late work criterion and common due date |
| 416 | -- | 422 | Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak, Frank Werner. Positive half-products and scheduling with controllable processing times |
| 423 | -- | 443 | T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Z. H. Liu. Single machine scheduling to minimize total weighted tardiness |
| 444 | -- | 456 | T. C. Edwin Cheng, Natalia V. Shakhlevich. Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem |
| 457 | -- | 467 | Marco Ghirardi, Chris N. Potts. Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach |
| 468 | -- | 478 | Gaurav Singh. Scheduling UET-UCT outforests to minimize maximum lateness |
| 479 | -- | 494 | Rubén Ruiz, Concepción Maroto. A comprehensive review and evaluation of permutation flowshop heuristics |
| 495 | -- | 509 | Klaus Neumann, Christoph Schwindt, Norbert Trautmann. Scheduling of continuous and discontinuous material flows with intermediate storage restrictions |
| 510 | -- | 524 | Francis Sourd, Jerome Rogerie. Continuous filling and emptying of storage systems in constraint-based scheduling |
| 525 | -- | 534 | Ramón Alvarez-Valdés, A. Fuertes, José Manuel Tamarit, G. Giménez, R. Ramos. A heuristic to schedule flexible job-shop in a glass factory |
| 535 | -- | 553 | Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif. Evolutionary algorithms for periodic arc routing problems |