Content
January 1997, Volume 69, Issue 0
- 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
Printed from https://ideas.repec.org/s/spr/annopr42.html