Content
April 1997, Volume 70, Issue 0
- 115-125 Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
by Suresh Chand & Rodney Traub & Reha Uzsoy - 127-143 Single machine hierarchical scheduling with customer orders and multiple job classes
by Jatinder Gupta & Johnny Ho & Jack van der Veen - 145-154 A single machine scheduling problem with common due window and controllable processing times
by Surya Liman & Shrikant Panwalkar & Sansern Thongmee - 155-170 Job shop scheduling with separable sequence-dependent setups
by In-Chan Choi & Osman Korkmaz - 171-189 Scheduling permutation flow shops using the Lagrangian relaxation technique
by Guandong Liu & Peter Luh & Richard Resch - 191-220 Stochastic scheduling of a batch processing machine with incompatible job families
by Izak Duenyas & John Neale - 221-239 Multi-objective stochastic scheduling of job ready times
by Paul Stanfield & Russell King & Thom Hodgson - 241-260 Sequencing jobs with random processing times to minimize weighted completion time variance
by X. Cai & S. Zhou - 261-279 Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
by H.A.J. Crauwels & C.N. Potts & L.N. Van Wassenhove - 281-306 An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
by Stéphane Dauzère-Pérès & Jan Paulli - 307-326 Problem space search algorithms for resource-constrained project scheduling
by Kedar Naphade & S. David Wu & Robert Storer - 327-357 Applying constraint satisfaction techniques to job shop scheduling
by Cheng-Chung Cheng & Stephen Smith - 359-378 On the design and development of object-oriented scheduling systems
by Michael Pinedo & Benjamin Yen - 379-397 Using beam search techniques for sequencing mixed-model assembly lines
by Yow-yuh Leu & Philip Huang & Roberta Russell - 399-413 Preemptive scheduling with finite capacity input buffers
by Nicholas Hall & Marc Posner & Chris Potts - 415-438 No-wait flow shop scheduling with large lot sizes
by Alessandro Agnetis - 439-472 An analysis of heuristics for the parallel-machine flexible-resource scheduling problem
by Richard Daniels & Barbara Hoopes & Joseph Mazzola - 473-492 Sizing and scheduling a full-time and part-time workforce with off-day and off-weekend constraints
by Hamilton Emmons & Du-Shean Fuh
January 1997, Volume 69, Issue 0
- 0 Preface
by Rainer Burkard & Toshihide Ibaraki & Maurice Queyranne - 1-31 Concurrent operations assignment and sequencing for particular assembly problems in flow lines
by Alessandro Agnetis & Claudio Arbib - 33-46 The aircraft rotation problem
by Lloyd Clarke & Ellis Johnson & George Nemhauser & Zhongxi Zhu - 47-64 Hitting or avoiding balls in Euclidean space
by Yves Crama & Toshihide Ibaraki - 65-84 Optimization of nuclear reactor reloading patterns
by E. de Klerk & C. Roos & T. Terlaky & T. Illés & A.J. de Jong & J. Valkó & J.E. Hoogenboom - 85-104 Skeleton-based facility layout design using genetic algorithms
by Hugues Delmaire & André Langevin & Diane Riopel - 105-114 A variation of the generalized assignment problem arising in the New Zealand dairy industry
by L.R. Foulds & J.M. Wilson - 115-134 A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
by Virginie Gabrel & Alain Moulet & Cécile Murat & Vangelis Paschos - 135-156 A dynamic programming algorithm for single machine scheduling with ready times
by Sylvie Gélinas & Francois Soumis - 157-169 Cost optimization for the slitting of core laminations for power transformers
by A. Gerstl & S.E. Karisch - 171-191 Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
by J.N.D. Gupta & A.M.A. Hariri & C.N. Potts - 193-207 Vehicle scheduling on a tree with release and handling times
by Yoshiyuki Karuno & Hiroshi Nagamochi & Toshihide Ibaraki - 209-226 Minimizing the number of robots to meet a given cyclic schedule
by Vladimir Kats & Eugene Levner - 227-239 DGAP - The Dynamic Generalized Assignment Problem
by Konstantin Kogan & Avraham Shtub - 241-259 Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
by Wieslaw Kubiak & George Steiner & Julian Scott Yeomans - 261-276 A parametric approach for maximum flow problems with an additional reverse convex constraint
by Takahito Kuno - 277-297 A mixed-integer model for solving ordering problems with side constraints
by Francesco Maffioli & Anna Sciomachen - 299-322 Queues with switchover - A review and critique
by Wanda Rosa-Hatko & Eldon Gunn - 323-349 Rolling horizon scheduling in a rolling-mill
by L. Stauffer & Th. Liebling - 351-377 Shop scheduling problems under precedence constraints
by V.A. Strusevich - 379-403 A modeling approach to a JIT-based ordering system
by Norio Watanabe & Shusaku Hiraki