default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 17
Volume 17, Number 1, 1990
- Chuen-Lung Chen, Robert L. Bulfin Jr.:
Scheduling unit processing time jobs on a single machine with multiple criteria. 1-7 - Patrick G. McKeown, Cliff T. Ragsdale:
A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems. 9-16 - Alan Levine, David Finkel:
Load balancing in a multi-server queuing system. 17-25 - Hani I. Mesak:
Impact of anticipated competitive entry and cost experience on optimal strategic pricing of technological innovations. 27-37 - Cengiz Haksever, Jeffrey L. Ringuest:
Computational efficiency and interactive molp algorithms: An implementation of the simolp procedure. 39-50 - Erhan Erkut, Thomas Baptie, Balder Von Hohenbalken:
The discrete p-Maxian location problem. 51-61 - Joseph Kreimer, Moshe Dror:
The monotonicity of the threshold detection probability in a stochastic accumulation process. 63-71 - Hark Hwang, Dug Hee Moon, Seong Whan Shinn:
An EOQ model with quantity discounts for both purchasing price and freight cost. 73-78 - James H. Bookbinder, Steven H. Edwards:
School-bus routing for program scheduling. 79-94 - Mike B. Wright:
Speeding up the hungarian algorithm. 95-96 - J. R. Rao, Nilima Roy:
Use of tranquility in determining the numerical compensation for a fuzzy multicriteria decision making problem. 97-103 - Timothy D. Fry, Ronald D. Armstrong, L. Drew Rosen:
Single machine scheduling to minimize mean absolute lateness: A heuristic solution. 105-112 - Ton Volgenant, Roy Jonker:
Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem. 113-117 - Hyo-Seong Lee:
A short note on the poisson input queuing system with start-up time and under control-operating policy. 119-121
Volume 17, Number 2, 1990
- Jati K. Sengupta:
Tests of efficiency in data envelopment analysis. 123-132 - Ue-Pyng Wen, Y. H. Yang:
Algorithms for solving the mixed integer two-level linear programming problem. 133-142 - Ana Friedlander, Filho C. Lyra, Hermano Tavares, Eunice L. Medina:
Optimization with staircase structure: An application to generation scheduling. 143-152 - Y. L. Chen, Y. H. Chin:
The quickest path problem. 153-161 - Fred F. Easton:
A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem. 163-175 - Christian N. Madu, Michael N. Chanin, Nicholas C. Georgantzas, Chu-hua Kuei:
Coefficient of variation: A critical factor in maintenance float policy. 177-185 - John R. Current, Charles S. Revelle, Jared L. Cohon:
An interactive approach to identify the best compromise solution for two objective shortest path problems. 187-198 - S. Selçuk Erengüç, Yasemin Aksoy:
A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints. 199-210 - LeRoy F. Simmons, Laurette Poulos Simmons, Mayur Mehta, Vivek Shah:
Cycle regression analysis: Simultaneous estimation of trigonometric components of a time series. 211-220 - Anna Sciomachen, R. Sozzi:
The algorithmic structure of a decision support system for a design of a district heating network. 221-230 - Prabuddha De, Jay B. Ghosh, Charles E. Wells:
Scheduling about a common due date with earliness and tardiness penalties. 231-241
Volume 17, Number 3, 1990
- F. A. Ogbu, David K. Smith:
The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem. 243-253 - Michael Bastian:
Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem. 255-263 - Byong-Hun Ahn, Jae-Ho Hyun:
Single facility multi-class job scheduling. 265-272 - D. C. Brauer, G. Naadimuthu:
Office facilities planning considering organizational constraints. 273-281 - James S. DeArmon:
Improving random number generators on micro-computers. 283-295 - Ram Gopalan, Rajan Batta, Mark H. Karwan
:
The equity constrained shortest path problem. 297-307 - John M. Wilson:
Compact normal forms in propositional logic and integer programming formulations. 309-314 - Rex K. Kincaid, Oded Z. Maimon:
A note on locating a central vertex of a 3-cactus graph. 315-320 - T. C. Edwin Cheng:
A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem. 321-324
Volume 17, Number 4, 1990
- Horst A. Eiselt, Carl-Louis Sandblom:
Experiments with external pivoting. 325-332 - Prabuddha De, Jay B. Ghosh, Charles E. Wells:
CON due-date determination and sequencing. 333-342 - Claude Dennis Pegden, Matthew Rosenshine:
Scheduling arrivals to queues. 343-348 - B. Madhu Rao:
On the departure process of the split and match queue. 349-357 - Eng Ung Choo, Gin Hor Chan:
Two-way eyeballing heuristics in dynamic lot sizing with backlogging. 359-363 - Tien Y. Kao, Elsayed A. Elsayed:
Performance of the LPT algorithm in multiprocessor scheduling. 365-373 - Ashok Vernekar, Gnana Anandalingam, C. N. Dorny:
Optimization of resource location in hierarchical computer networks. 375-388 - Jae D. Hong, M. Jeya Chandra:
A heuristic algorithm to minimize the number of crews allocated in an airlift operation. 389-396 - Bajis Dodin, Mete Sirvanci:
Stochastic networks and the extreme value distribution. 397-409 - Muhittin Oral, Ossama Kettani:
Modeling outranking process as a mathematical programming problem. 411-423 - T. C. Edwin Cheng:
A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem. 425-426
Volume 17, Number 5, 1990
- Rajesh Srivastava, W. C. Benton:
The location-routing problem: Considerations in physical distribution system design. 427-435 - Charles Friden, Alain Hertz, Dominique de Werra:
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph. 437-445 - Peter C. Bell, Arshad A. Taseen, Paul F. Kirkpatrick:
Visual interactive simulation modeling in a decision support role. 447-456 - Youling Lin, Larry M. Austin, James R. Burns:
An implicit branch-and-bound algorithm for mixed-integer-linear programming. 457-464 - David Romero, Adolfo Sánchez-Flores:
Methods for the one-dimensional space allocation problem. 465-473 - George D. Tsiotras, Hussein Badr:
A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite capacity. 475-479 - Geoffrey Bianchi, Richard L. Church:
A heuristic for a hybrid fleet model. 481-494 - Malachy Carey:
Extending and solving a multiperiod congested network flow model. 495-507 - Richard F. Deckro, Sarangan Rangachari:
A goal approach to assembly line balancing. 509-521
Volume 17, Number 6, 1990
- James P. Ignizio:
A brief introduction to expert systems. 523-533 - Paul N. Finlay:
Decision support systems and expert systems: A comparison of their components and design methodologies. 535-543 - Jay Liebowitz:
Introducing an expert systems course into the operations research curriculum. 545-552 - Robert R. Trippi, Efraim Turban:
Auto-learning approaches for building expert systems. 553-560 - Tom M. Cavalier, Panos M. Pardalos, Allen L. Soyster:
Modeling and integer programming techniques applied to propositional calculus. 561-570 - Don E. Deal, Jen-Gwo Chen, James P. Ignizio, V. Jeyakumar:
An expert system scheduler: Some reflections on expert systems development. 571-580 - Samuel J. Raff:
Preface. - James P. Ignizio:
Foreword.
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 2025-12-02 23:28 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:
