Volume 165, Number 1, August 2005
- Charles S. Revelle, Horst A. Eiselt:
Location analysis: A synthesis and survey.
1-19

- Gur Mosheiov:
Minimizing total completion time and total deviation of job completion times from a restrictive due-date.
20-33

- Rubén Ruiz, Concepción Maroto, Javier Alcaraz:
Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics.
34-54

- Thomas Dunker, Günter Radons, Engelbert Westkämper:
Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem.
55-69

- Michel Vasquez, Yannick Vimont:
Improved results on the 0-1 multidimensional knapsack problem.
70-81

- Francis Sourd:
Optimal timing of a sequence of tasks with general completion costs.
82-96

- Daniel Villeneuve, Guy Desaulniers:
The shortest path problem with forbidden paths.
97-107

- Hoon Jung, Cerry M. Klein:
Optimal inventory policies for an economic order quantity model with decreasing cost functions.
108-126

- Linda van Norden, Steef L. van de Velde:
Multi-product lot-sizing with a transportation capacity reservation contract.
127-138

- Subhashish Samaddar, Gad Rabinowitz, Guoqiang Peter Zhang:
An experimental analysis of solution performance in a resource sharing and scheduling problem.
139-156

- Amiya K. Chakravarty:
Global plant capacity and product allocation with pricing decisions.
157-181

- Erdem Eskigun, Reha Uzsoy, Paul V. Preckel, George Beaujon, Subramanian Krishnan, Jeffrey D. Tew:
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers.
182-206

- Hartanto Wong, Dirk Cattrysse, Dirk Van Oudheusden:
Inventory pooling of repairable spare parts with non-zero lateral transshipment time and delayed lateral transshipments.
207-218

- Selwyn Piramuthu:
Knowledge-based framework for automated dynamic supply chain configuration.
219-230

- Abraham Grosfeld-Nir:
A two-bottleneck system with binomial yields and rigid demand.
231-250

- Manipushpak Mitra:
Incomplete information and multiple machine queueing problems.
251-266

- Kevin D. Glazebrook, H. M. Mitchell, P. S. Ansell:
Index policies for the maintenance of a collection of machines by a set of repairmen.
267-284

Volume 165, Number 2, September 2005
Project Management and Scheduling
- Vicente Valls, Jan Weglarz:
Project management and scheduling.
285-288

- Willy Herroelen, Roel Leus:
Project scheduling under uncertainty: Survey and research potentials.
289-306

- Salah E. Elmaghraby:
On the fallacy of averages in project risk management.
307-313

- Christian Artigues, Jean-Charles Billaut, Carl Esswein:
Maximization of solution flexibility for robust shop scheduling.
314-328

- Anand Paul, Genaro Gutierrez:
Simple probability models for project contracting.
329-338

- Can Akkan, Andreas Drexl, Alf Kimms:
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem.
339-358

- Mario Vanhoucke:
New computational results for the discrete time/cost trade-off problem with time-switch constraints.
359-374

- Vicente Valls, Francisco Ballestín, Sacramento Quintanilla:
Justification and RCPSP: A technique that pays.
375-386

- Sergey V. Sevastianov:
An introduction to multi-parameter complexity analysis of discrete problems.
387-397

- Peter Brucker, Sigrid Knust, Guoqing Wang:
Complexity results for flow-shop problems with a single server.
398-407

- Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
The two-machine flow-shop problem with weighted late work criterion and common due date.
408-415

- Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak, Frank Werner:
Positive half-products and scheduling with controllable processing times.
416-422

- T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Zhaohui Liu:
Single machine scheduling to minimize total weighted tardiness.
423-443

- T. C. Edwin Cheng, Natalia V. Shakhlevich:
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem.
444-456

- Marco Ghirardi, Chris N. Potts:
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach.
457-467

- Gaurav Singh:
Scheduling UET-UCT outforests to minimize maximum lateness.
468-478

- Rubén Ruiz, Concepción Maroto:
A comprehensive review and evaluation of permutation flowshop heuristics.
479-494

- Klaus Neumann, Christoph Schwindt, Norbert Trautmann:
Scheduling of continuous and discontinuous material flows with intermediate storage restrictions.
495-509

- Francis Sourd, Jerome Rogerie:
Continuous filling and emptying of storage systems in constraint-based scheduling.
510-524

- 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.
525-534

- Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif:
Evolutionary algorithms for periodic arc routing problems.
535-553

Volume 165, Number 3, September 2005
- Marc Demange, Vangelis Th. Paschos:
Polynomial approximation algorithms with performance guarantees: An introduction-by-example.
555-568

- Morten Riis, Kim Allan Andersen:
Applying the minimax criterion in stochastic recourse programs.
569-584

- X. M. Yang, X. Q. Yang, K. L. Teo, S. H. Hou:
Multiobjective second-order symmetric duality with F.
585-591

- Seema Khurana:
Symmetric duality in multiobjective programming involving generalized cone-invex functions.
592-597

- Predrag S. Stanimirovic, Nebojsa V. Stojkovic, Vera V. Kovacevic-Vujcic:
Stabilization of Mehrotra's primal-dual algorithm and its implementation.
598-609

- Daniela Ambrosino, Maria Grazia Scutellà:
Distribution network design: New problems and related models.
610-624

- Hanif D. Sherali, Youngho Lee, Youngjin Kim:
Partial convexification cuts for 0-1 mixed-integer programs.
625-648

- Claudio T. Bornstein, Luciane Ferreira Alcoforado, Nelson Maculan:
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem.
649-656

- Ching-Wu Chu:
A heuristic algorithm for the truckload and less-than-truckload problem.
657-667

- Ann Melissa Campbell, Jill R. Hardin:
Vehicle minimization for periodic deliveries.
668-684

- Wen Lea Pearn, Chien-Wei Wu:
A Bayesian approach for assessing process precision based on multiple samples.
685-695

- Eyas Shuiabi, Vincent Thomson, Nadia Bhuiyan:
Entropy as a measure of operational flexibility.
696-707

- Jannes Slomp, Nallan C. Suresh:
The shift team formation problem in multi-shift manufacturing operations.
708-728

- Loo Hay Lee, Ek Peng Chew:
A dynamic joint replenishment policy with auto-correlated demand.
729-747

- Ronald S. Tibben-Lembke, Yehuda Bassok:
An inventory model for delayed customization: A hybrid approach.
748-764

- Byung-Kook Kang:
Optimal stopping problem with double reservation value property.
765-785

- Vanderlei da Costa Bueno:
Minimal standby redundancy allocation in a k.
786-793

- Scott E. Grasman, Tava Lennon Olsen, John R. Birge:
Finite buffer polling models with routing.
794-809

- Nihal Pekergin, Tugrul Dayar, Denizhan N. Alparslan:
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering.
810-825

- Jack P. C. Kleijnen, Wim C. M. Van Beers:
Robustness of Kriging when interpolating in random simulation with heterogeneous variances: Some experiments.
826-834

- Jung-Fa Tsai, Han-Lin Li:
Technical note - On optimization approach for multidisk vertical allocation problems.
835-842

- Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng:
On the single machine total tardiness problem.
843-846

Last update Wed May 22 17:33:41 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page