default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 92
Volume 92, 1999
- Preface. 0
- Kevin D. Glazebrook, José Niño-Mora:
A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks. 1-18 - Kevin D. Glazebrook, Renate Garbe:
Almost optimal policies for stochastic systemswhich almost satisfy conservation laws. 19-43 - Klaus Neumann, Welf G. Schneider:
Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints. 45-63 - Gideon Weiss:
An algorithm for minimum wait drainingof two‐station fluid re‐entrant line. 65-86 - Alex E. Gerodimos, Celia A. Glass, Chris N. Potts, Thomas Tautenhahn:
Scheduling multi‐operation jobs on a single machine. 87-105 - Jatinder N. D. Gupta, A. M. A. Hariri, Chris N. Potts:
Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs. 107-123 - Rainer Schrader, Georg Wambach:
The setup polytope of N‐sparse posets. 125-142 - Ricki Wegner:
Recovering cyclic schedules from delay. 143-164 - Christelle Guéret, Christian Prins:
A new lower bound for the open‐shop problem. 165-183 - Inna G. Drobouchevitch, Vitaly A. Strusevich:
A polynomial algorithm for the three‐machineopen shop with a bottleneck machine. 185-210 - Alexander V. Kononov, Sergey V. Sevastianov, I. D. Tchernykh:
When difference in machine loads leadsto efficient scheduling in open shops. 211-239 - Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius:
On the set of solutions of the open shop problem. 241-263 - Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius:
On the hardness of the classical job shop problem. 265-279 - Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner:
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. 281-304 - Philippe Baptiste, Claude Le Pape, Wim Nuijten:
Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems. 305-333 - Hans Kellerer, Ulrich Pferschy:
Cardinality constrained bin‐packing problems. 335-348 - Federico Della Croce, Roberto Tadei, P. S. Asioli:
Scheduling a round robin tennis tournamentunder courts and players availability constraints. 349-361 - Emma Hart, Peter Ross, Jeremy A. D. Nelson:
Scheduling chicken catching ‐ An investigationinto the success of a genetic algorithm on areal‐world scheduling problem. 363-380 - Jannet I. van Zante-de Fokkert, A. G. de Kok:
The simultaneous determination of the assignment ofitems to resources, the cycle times, and the reorderintervals in repetitive PCB assembly. 381-401
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 2024-11-22 19:33 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:
