default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research, Volume 26
Volume 26, Number 1, January / February 1978
- M. R. Garey, Ronald L. Graham, David S. Johnson:
Performance Guarantees for Scheduling Algorithms. 3-21 - Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Complexity of Scheduling under Precedence Constraints. 22-35 - Teofilo F. Gonzalez, Sartaj Sahni:
Flowshop and Jobshop Schedules: Complexity and Approximation. 36-52 - B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
A General Bounding Scheme for the Permutation Flow-Shop Problem. 53-67 - Ilya B. Gertsbakh, Helman I. Stern:
Minimal Resources for Fixed and Variable Job Schedules. 68-85 - Jean-Claude Picard, Maurice Queyranne:
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling. 86-110 - Kenneth R. Baker, Linus Schrage:
Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks. 111-120 - Hiroshi Kise, Toshihide Ibaraki, Hisashi Mine:
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times. 121-126 - Sudarshan K. Dhall, C. L. Liu:
On a Real-Time Scheduling Problem. 127-140 - Hussein M. Abdel-Wahab, Tiko Kameda:
Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints. 141-158 - Robert R. Love Jr., Rao R. Vemuganti:
The Single-Plant Mold Allocation Problem with Capacity and Changeover Restrictions. 159-165 - Marshall L. Fisher, Ramchandran Jaikumar:
An Algorithm for the Space-Shuttle Scheduling Problem. 166-182 - Elio Cunto:
Scheduling Boats to Sample Oil Wells in Lake Maracaibo. 183-196 - Donald R. Smith:
Technical Note - A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline. 197-199 - Jatinder N. D. Gupta, S. S. Reddi:
Technical Note - Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem. 200-203 - Wlodzimierz Szwarc:
Technical Note - Dominance Conditions for the Three-Machine Flow-Shop Problem. 203-206 - Fennell Burns, John Rooker:
Technical Note - Three-Stage Flow-Shops with Recessive Second Stage. 207-208
Volume 26, Number 2, March / April 1978
- Jeff L. Kennington:
A Survey of Linear Cost Multicommodity Network Flows. 209-236 - Edward J. Ignall, Peter J. Kolesar, Warren E. Walker:
Using Simulation to Develop and Validate Analytic Models: Some Case Studies. 237-253 - Ralph E. Steuer, Albert T. Schuler:
An Interactive Multiple-Objective Linear Programming Approach to a Problem in Forest Management. 254-269 - Vincent P. Simpson:
Optimum Solution Structure for a Repairable Inventory Problem. 270-281 - Edward J. Sondik:
The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs. 282-304 - Donald M. Topkis:
Minimizing a Submodular Function on a Lattice. 305-321 - Donald Wehrung:
Interactive Identification and Optimization Using a Binary Preference Relation. 322-332 - Thoddi C. T. Kotiah:
Approximate Transient Analysis of Some Queuing Systems. 333-346 - Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Technical Note - On the Expected Performance of Branch-and-Bound Algorithms. 347-349 - Evan L. Porteus, John C. Totten:
Technical Note - Accelerated Computation of the Expected Discounted Return in a Markov Chain. 350-358 - John J. Dinkel, Gary A. Kochenberger:
Technical Note - An Implementation of Surrogate Constraint Duality. 358-364 - Richard D. McBride:
Technical Note - Dynamic Generalized Upper Bounding. 365-369 - Fred W. Glover, Darwin Klingman:
Letter to the Editor - Comments on a Note by Hatch on Network Algorithms. 370-374 - Thoddi C. T. Kotiah, David I. Steinberg:
Letter to the Editor - On the Possibility of Cycling with the Simplex Method. 374-376 - Maurice Queyranne:
Letter to the Editor - On "A 'Hard' Assignment Problem" by Machol and Wien. 376
Volume 26, Number 3, May / June 1978
- Alfred Blumstein, Daniel Nagin:
On the Optimum Use of Incarceration for Crime Control. 381-405 - John R. Hauser:
Testing the Accuracy, Usefulness, and Significance of Probabilistic Choice Models: An Information-Theoretic Approach. 406-421 - Jean-Claude Picard, H. Donald Ratliff:
A Cut Approach to the Rectilinear Distance Facility Location Problem. 422-433 - Christos H. Papadimitriou, Kenneth Steiglitz:
Some Examples of Difficult Traveling Salesman Problems. 434-443 - Linus Schrage, Kenneth R. Baker:
Dynamic Programming Solution of Sequencing Problems with Precedence Constraints. 444-449 - Charles S. Tapiero:
Optimum Advertising and Goodwill under Uncertainty. 450-463 - Steven Nahmias:
The Fixed-Charge Perishable Inventory Problem. 464-481 - Mark R. Lembersky:
Maximum Return from a Collection of Standard and Special Appreciating Assets. 482-491 - Charles D. Pack:
The Output of Multiserver Queuing Systems. 492-509 - Per Hokstad:
Approximations for the M/G/m Queue. 510-523
Volume 26, Number 4, July / August 1978
- Lawrence D. Bodin, Samuel J. Kursh:
A Computer-Assisted System for the Routing and Scheduling of Street Sweepers. 525-537 - John J. Jarvis, Ronald L. Rardin, V. E. Unger, Richard W. Moore, Charles C. Schimpeler:
Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model. 538-550 - S. Arunkumar, K. Chon:
On Optimal Regulation Policies for Certain Multi-Reservoir Systems. 551-562 - Eugene L. Lawler, B. D. Sivazlian:
Minimization of Time-Varying Costs in Single-Machine Scheduling. 563-569 - Richard L. Francis, Timothy J. Lowe, H. Donald Ratliff:
Distance Constraints for Tree Network Multifacility Location Problems. 570-596 - Lawrence M. Ostresh Jr.:
On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem. 597-609 - Mark D. Pankin:
Evaluating Offensive Performance in Baseball. 610-619 - George M. Constantinides, Scott F. Richard:
Existence of Optimal Simple Policies for Discounted-Cost Inventory and Cash Management in Continuous Time. 620-636 - J. Mensching, S. Garstka, T. Morton:
Protective Planning-Horizon Procedures for a Deterministic Cash Balance Problem. 637-652 - Donald R. Smith:
Optimal Repair of a Series System. 653-662 - David V. Mastran, Nozer D. Singpurwalla:
A Bayesian Estimation of the Reliability of Coherent Structures. 663-672 - James R. Evans:
Technical Note - A Single-Commodity Transformation for Certain Multicommodity Networks. 673-680 - Barry R. Marks, Gordon P. Wright:
Technical Note - A General Inner Approximation Algorithm for Nonconvex Mathematical Programs. 681-683
Volume 26, Number 5, September / October 1978
- Bennett L. Fox:
Data Structures and Computer Science Techniques in Operations Research. 686-717 - Sartaj Sahni, Ellis Horowitz:
Combinatorial Problems: Reductibility and Approximation. 718-759 - A. K. Chandra, Daniel S. Hirschberg, C. K. Wong:
Bin Packing with Geometric Constraints in Computer Network Design. 760-772 - David R. Stoutemyer:
Automatic Categorization of Optimization Problems: An Application of Computer Symbolic Mathematics. 773-788 - Gary H. Sockut:
A Performance Model for Computer Data-Base Reorganization Performed Concurrently with Usage. 789-804 - Prabuddha De, William D. Haseman, Charles H. Kriebel:
Toward an Optimal Design of a Network Database from Relational Descriptions. 805-823 - K. Dan Levin, Howard Lee Morgan:
A Dynamic Optimization Model for Distributed Databases. 824-835 - Zaw-Sing Su, Kenneth C. Sevcik:
A Combinatorial Approach to Dynamic Scheduling Problems. 836-844 - Manfred Ruschitzka:
An Analytical Treatment of Policy Function Schedulers. 845-863 - Edward G. Coffman Jr., Micha Hofri:
A Class of FIFO Queues Arising in Computer Systems. 864-880 - Richard E. Nance, U. Narayan Bhat:
A Processor Utilization Model for a Multiprocessor Computer System. 881-895 - Donald L. Iglehart, Gerald S. Shedler:
Simulation of Response Times in Finite-Capacity Open Networks of Queues. 896-914 - Richard E. Nance, Claude Overstreet Jr.:
Some Experimental Observations on the Behavior of Composite Random Number Generators. 915-935
Volume 26, Number 6, November / December 1978
- Michael Shwartz:
A Mathematical Model Used to Analyze Breast Cancer Screening Strategies. 937-955 - Louis J. Billera, David C. Heath, Joseph Raanan:
Internal Telephone Billing Rates - A Novel Application of Non-Atomic Game Theory. 956-965 - Steven J. Brams, Morton D. Davis:
Optimal Jury Selection: A Game-Theoretic Model for the Exercise of Peremptory Challenges. 966-991 - Donald Erlenkotter:
A Dual-Based Procedure for Uncapacitated Facility Location. 992-1009 - S. Christian Albright, Wayne L. Winston:
A Probabilistic Model of Winners' Outs versus Losers' Outs Rules in Basketball. 1010-1019 - S. Stashevsky, Igal Adiri:
Design of a Computerized Message-Switching Center. 1020-1032 - Edward P. C. Kao:
A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem. 1033-1045 - Thomas E. Morton:
Universal Planning Horizons for Generalized Convex Production Scheduling. 1046-1058 - Frederick J. Beutler, Benjamin Melamed:
Decomposition and Customer Streams of Feedback Networks of Queues in Equilibrium. 1059-1072 - Avinoam Perry:
Technical Note - A Modified Conjugate Gradient Algorithm. 1073-1078 - Sankaran Lakshminarayan, Ram Lakshmanan, Robert L. Papineau, Rene Rochette:
Technical Note - Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties. 1079-1082 - William G. Marchal:
Technical Note - Some Simpler Bounds on the Mean Queuing Time. 1083-1088
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 2026-08-09 23:01 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
