Operations Research 1997: Vol 45 Index

11 Pages·1997·3.5 MB·English

INDICES TO VOLUMI!I £5: 1997
AREA INDEX
COMPUTING MANUFACTURING, OPERATIONS, AND
SCHEDULING
Aggarwal, Charu C., James B. Orlin, and Ray P. Tai,
Optimized Crossover for the Independent Set Problem, Adams, J. B. and D. S. Hochbaum, A New and Fast
226-234. Approach to Very Large Scale Integrated Sequential
Circuit Test Generation, 842-856.
Bilge, Umit and Gunduz Ulusoy, Letter to the Editor,
DECISION MAKING
322.
Deichtmann, Jean M. and Francois Sainfort, On the Buss, Arnold H. and Meir J. Rosenblatt, Activity Delay
Difference Between the Cardinalities of Measurable in Stochastic Project Networks, 126-139.
Value Functions and von Neumann-Morgenstern Utility Dauzere-Peres, Stephane and Jean-Bernard Lasserre,
Functions, 307-308. Lot Streaming in Job-Shop Scheduling, 584-595.
Korhonen, Pekka, Seppo Salo, and Ralph E. Steuer, A De, Prabuddha, E. James Dunne, Jay B. Ghosh, and
Heuristic for Estimating Nadir Criterion Values in Mul- Charles E. Wells, Complexity of the Discrete Time-
tiple Objective Linear Programming, 751-757. Cost Tradeoff Problem for Project Networks, 302-306.
Demeulemeester, Erik L. and Willy S. Herroelen, A
Branch-and-Bound Procedure for the Generalized
DISTRIBUTION, TRANSPORTATION, AND
Resource-Constrained Project Scheduling Problem,
LOGISTICS 201-212.
Eppen, Gary D. and Ananth. V. Iyer, Improved Fashion
Fisher, Marshall L., Kurt O. Jornsten, and Oli B. G.
Buying with Bayesian Updates, 805-819.
Madsen, Vehicle Routing with Time Windows: Two
Flynn, James and Stanley Garstka, The Optimal Review
Optimization Algorithms, 488-492.
Period in a Dynamic Inventory Model, 736-750.
Gendreau, Michel, Gilbert Laporte, and Alain Hertz,
Hodgson, Thom J., Russell E. King, and Paul M. Stan-
An Approximation Algorithm for the Traveling Sales-
field, Ready-Time Scheduling with Stochastic Service
man Problem with Backhauls, 639-641.
Times, 779-783.
Gendreau, Michel, Gilbert Laporte, and Frederic Se-
Ha, Albert Y., Optimal Dynamic Scheduling Policy for a
met, The Covering Tour Problem, 568-576.
Make-to-Stock Production System, 42-53.
Herer, Yale and Robin Roundy, Heuristics for a One-
Hall, Nicholas G., Hichen Kamoun, and Chelliah Sris-
Warehouse Multiretailer Distribution Problem with Per-
kandarajah, Scheduling in Robotic Cells: Classifica-
formance Bounds, 102-115.
tion, Two and Three Machine Cells, 421-439.
Kohl, Niklas and Oli B. G. Madsen, An Optimization
Hochbaum, Dorit S. and Dan Landy, Scheduling Semi-
Algorithm for the Vehicle Routing Problem with Time
conductor Burn-In Operations to Minimize Total Flow-
Windows Based on Lagrangian Relaxation, 395-406.
time, 874-885.
Mingozzi, Aristide, Lucio Bianco, and Salvatore Ric-
Jurisch, Bernd and Wieslaw Kubiak, 7Two-Machine
ciardelli, Dynamic Programming Strategies for the
Open Shops with Renewable Resources, 544-552.
Traveling Salesman Problem with Time Window and
Kroon, Leo G., Mare Salomon, and Luk N. van Was-
Precedence Constraints, 364-377. senhove, Exact and Approximation Algorithms for the
Vance, Pamela H., Cynthia Barnhart, Ellis L. Johnson, Tactical Fixed Scheduling Problem, 624-638.
and George L. Nemhauser, Airline Crew Scheduling: Lederer, Phillip J. and Lode Li, Pricing, Production,
A New Formulation and Decomposition Algorithm, Scheduling, and Delivery-Time Competition, 407-420.
188-200. Lee, Chung-Yee and George L. Vairaktarakis, Workforce
Planning in Mixed Model Assembly Systems, 553-567.
MANUFACTURING OPERATIONS Lee, Tae-Eog and Marc E. Posner, Performance Mea-
sures and Schedules in Periodic Job Shops, 72-91.
Nahmias, Steven and Kamran Moinzadeh, Lot Sizing Lippman, Steven A. and Kevin F. McCardle, The Com-
with Randomly Graded Yields, 974-986. petitive Newsboy, 54-65.
Sun, Daning and Derek Atkins, 98%-Effective Lot-Sizing Mazzola, Joseph B. and Kevin F. McCardle, The Sto-
for Assembly Inventory Systems with Backlogging, chastic Learning Curve: Optimal Production in the
940-951. Presence of Learning-Curve Uncertainty, 440-450.
INDICES TO VOLUMI!I £5: 1997
AREA INDEX
COMPUTING MANUFACTURING, OPERATIONS, AND
SCHEDULING
Aggarwal, Charu C., James B. Orlin, and Ray P. Tai,
Optimized Crossover for the Independent Set Problem, Adams, J. B. and D. S. Hochbaum, A New and Fast
226-234. Approach to Very Large Scale Integrated Sequential
Circuit Test Generation, 842-856.
Bilge, Umit and Gunduz Ulusoy, Letter to the Editor,
DECISION MAKING
322.
Deichtmann, Jean M. and Francois Sainfort, On the Buss, Arnold H. and Meir J. Rosenblatt, Activity Delay
Difference Between the Cardinalities of Measurable in Stochastic Project Networks, 126-139.
Value Functions and von Neumann-Morgenstern Utility Dauzere-Peres, Stephane and Jean-Bernard Lasserre,
Functions, 307-308. Lot Streaming in Job-Shop Scheduling, 584-595.
Korhonen, Pekka, Seppo Salo, and Ralph E. Steuer, A De, Prabuddha, E. James Dunne, Jay B. Ghosh, and
Heuristic for Estimating Nadir Criterion Values in Mul- Charles E. Wells, Complexity of the Discrete Time-
tiple Objective Linear Programming, 751-757. Cost Tradeoff Problem for Project Networks, 302-306.
Demeulemeester, Erik L. and Willy S. Herroelen, A
Branch-and-Bound Procedure for the Generalized
DISTRIBUTION, TRANSPORTATION, AND
Resource-Constrained Project Scheduling Problem,
LOGISTICS 201-212.
Eppen, Gary D. and Ananth. V. Iyer, Improved Fashion
Fisher, Marshall L., Kurt O. Jornsten, and Oli B. G.
Buying with Bayesian Updates, 805-819.
Madsen, Vehicle Routing with Time Windows: Two
Flynn, James and Stanley Garstka, The Optimal Review
Optimization Algorithms, 488-492.
Period in a Dynamic Inventory Model, 736-750.
Gendreau, Michel, Gilbert Laporte, and Alain Hertz,
Hodgson, Thom J., Russell E. King, and Paul M. Stan-
An Approximation Algorithm for the Traveling Sales-
field, Ready-Time Scheduling with Stochastic Service
man Problem with Backhauls, 639-641.
Times, 779-783.
Gendreau, Michel, Gilbert Laporte, and Frederic Se-
Ha, Albert Y., Optimal Dynamic Scheduling Policy for a
met, The Covering Tour Problem, 568-576.
Make-to-Stock Production System, 42-53.
Herer, Yale and Robin Roundy, Heuristics for a One-
Hall, Nicholas G., Hichen Kamoun, and Chelliah Sris-
Warehouse Multiretailer Distribution Problem with Per-
kandarajah, Scheduling in Robotic Cells: Classifica-
formance Bounds, 102-115.
tion, Two and Three Machine Cells, 421-439.
Kohl, Niklas and Oli B. G. Madsen, An Optimization
Hochbaum, Dorit S. and Dan Landy, Scheduling Semi-
Algorithm for the Vehicle Routing Problem with Time
conductor Burn-In Operations to Minimize Total Flow-
Windows Based on Lagrangian Relaxation, 395-406.
time, 874-885.
Mingozzi, Aristide, Lucio Bianco, and Salvatore Ric-
Jurisch, Bernd and Wieslaw Kubiak, 7Two-Machine
ciardelli, Dynamic Programming Strategies for the
Open Shops with Renewable Resources, 544-552.
Traveling Salesman Problem with Time Window and
Kroon, Leo G., Mare Salomon, and Luk N. van Was-
Precedence Constraints, 364-377. senhove, Exact and Approximation Algorithms for the
Vance, Pamela H., Cynthia Barnhart, Ellis L. Johnson, Tactical Fixed Scheduling Problem, 624-638.
and George L. Nemhauser, Airline Crew Scheduling: Lederer, Phillip J. and Lode Li, Pricing, Production,
A New Formulation and Decomposition Algorithm, Scheduling, and Delivery-Time Competition, 407-420.
188-200. Lee, Chung-Yee and George L. Vairaktarakis, Workforce
Planning in Mixed Model Assembly Systems, 553-567.
MANUFACTURING OPERATIONS Lee, Tae-Eog and Marc E. Posner, Performance Mea-
sures and Schedules in Periodic Job Shops, 72-91.
Nahmias, Steven and Kamran Moinzadeh, Lot Sizing Lippman, Steven A. and Kevin F. McCardle, The Com-
with Randomly Graded Yields, 974-986. petitive Newsboy, 54-65.
Sun, Daning and Derek Atkins, 98%-Effective Lot-Sizing Mazzola, Joseph B. and Kevin F. McCardle, The Sto-
for Assembly Inventory Systems with Backlogging, chastic Learning Curve: Optimal Production in the
940-951. Presence of Learning-Curve Uncertainty, 440-450.
Area Index: 1997 / 991
McGavin, Edward J., James E. Ward, and Leroy B. Mireault, Paul, James B. Orlin, and Rakesh V. Vohra,
Schwarz, A Branch-and-Price Algorithm for the Gener- A Parametric Worst Case Analysis of the LPT Heuristic
alized Assignment Problem, 820-830. for Two Uniform Machines, 116-125.
Moinzadeh, Kamran and Prabhu K. Aggarwal, An /n- Munier, Alix and Jean-Claude Konig, A Heuristic for a
formation Based Multiechelon Inventory System with Scheduling Problem with Communication Delays,
Emergency Orders, 694-701. 145-152.
Mukhopadhyay, Samar K. and Panagiotis Kouvelis, A Pisinger, David, A Minimal Algorithm for the 0-1 Knap-
Differential Game Theoretic Model for Ducpolistic sack Problem, 758-767.
Competition on Design Quality, 886-893. Savelsbergh, Martin, A Branch-and-Price Algorithm for
Nurani, Raman K., Sridhar Seshadri, and J. George the Generalized Assignment Problem, 831-841.
Shanthikumar, Optimal Control of a Single Stage Pro-
Williamson, D. P., L. A. Hall, J. A. Hoogeveen, C. A. J.
duction System Subject to Random Process Shifts,
Hurkens, J. K. Lenstra, S. V. Sevast’janov, and D. B.
713-724. Shmoys, Short Shop Schedules, 288-294.
Samaratunga, Chand, Suresh P. Sethi, and Xun Yu
Zhou, Computational Evaluation of Hierarchical Pro- OR CHRONICLE
duction Control Policies for Stochastic Manufacturing
Systems, 258-274. Murphy, Frederic H. and Venkat Panchanadam, Under-
Sharifnia, Ali, /nstability of the Join-the-Shortest-Queue standing Linear Program Modeling Through an Exam-
and FCFS Policies in Queuing Systems and Their Sta- ination of the Early Papers on Model Formulation,
bilization, 309-314. 341-356.
Seshadri, Sridhar and J. G. Shanthikumar, Allocation Ormerod, Richard and Ioannis Kiossis, OR/MS Publi-
of Chips to Wafers in a Production Problem of Semi- cations: Extension of the Analysis of U.S. Flagship
conductor Kits, 315-321. Journals to the United Kingdom, 178-187.
Thonemann, Ulrich W. and Margaret L. Brandeau, De- Pritsker, A. Alan B., Modeling in Performance-
signing a Zoned Automated Guided Vehicle System Enhancing Processes, 797-804.
with Multiple Vehicles and Multiple Load Capacity, Reisman, Arnold, Ashok Kumar, Jaideep Motwani, and
857-873. Chun Hung Cheng, Cellular Manufacturing: A Statis-
Wang, M. Y., S. P. Sethi, and S. L. van de Velde, Minimiz- tical Review of the Literature, 508-520.
ing Makespan in a Class of Reentrant Shops, 702-712.
Zhang, Hongtao and Stephen C. Graves, Cyclic Sched- OR PRACTICE
uling in a Stochastic Environment, 894-903.
Ahmadi, Reza H., Managing Capacity and Flow at
Theme Parks, 1-13.
MANUFACTURING, PRODUCTION AND
SCHEDULING Bevers, Michael, John Hof, Daniel W. Uresk, and Greg-
ory L. Schenbeck, Spatial Optimization of Prairie Dog
Crama, Yves and Joris van de Klundert, Cyclic Sched- Colonies for Black-Footed Ferret Recovery, 495-507.
uling of Identical Parts in a Robotic Cell, 952-965. Day, Paul R. and David M. Ryan, Flight Attendant Ros-
tering for Short-Haul Airline Operations, 649-661.
NONTRADITIONAL OR NEW AREAS
Degraeve, Zeger and Linus Schrage, A Tire Production
Lim, Wei Shi, Steve Alpern, and Anatole Beck, Rendez- Scheduling System for Bridgestone/Firestone Off-the-
vous Search on the Line with More Than Two Players, Road, 789-796.
357-364. Helton, J. C., D. R. Anderson, M. G. Marietta, and
R. P. Rechard, Performance Assessment for the Waste
OPTIMIZATION Isolation Pilot Plant, \S7-177.
Federgruen, Awi and Garrett van Ryzin, Probabilistic Hopp, Wallace J., Mark L. Spearman, and Rachel Q.
Analysis of a Generalized Bin Packing Problem and Zhang, Easily Implementable Inventory Control Poli-
Applications, 596-609. cies, 327-340.
Fischetti, Matteo, Juan Jose Salazar Gonzalez, and Paolo
Toth, A Branch-and-Cut Algorithm for the Symmetric PROPORTIONAL EQUITY FLOW
Generalized Traveling Salesman Problem, 378-394. Betts, Lisa M. and J. Randall Brown, Proportional Eq-
Gochet, Willy, Antonie Stam, V. Srinivasan, Shaoxiang uity Flow Problem for Terminal Arcs, 521-535.
Chen, Multigroup Discriminant Analysis Using Linear
Programming, 213-225.
PUBLIC SERVICES AND MILITARY
Hadj-Alouane, Ben Atidel and James C. Bean, A Ge-
netic Algorithm for the Multiple-Choice Integer Pro- Griggs, Brian J., Gregory S. Parnell, and Lee J. Leh-
gram, 92-101. mkuhl, An Air Mission Planning Algorithm Using De-
Martello, Silvano and Paolo Toth, Upper Bounds and cision Analysis and Mixed Integer Programming,
Algorithms for Hard 0-1 Knapsack Problems, 768-778. 662-676.
992 / INDICES TO VOLUME 45: 1997
STOCHASTIC PROCESSES & THEIR Gallego, Guillermo and Garrett Van Ryzin, A Multi-
APPLICATIONS product Dynamic Pricing Problem and Its Applications
to Network Yield Management, 24-41.
Abboud, Nadim E. and John N. Daigle, A Little’s Result
Gans, Noah and Garrett van Ryzin, Optimal Control of
Approach to the Service Constrained Spares Provision-
a Multiclass, Flexible Queueing System, 677-693.
ing Problem for Repairable Items, 577-583.
Bertsimas, Dimitris and Georgia Mourtzinou, Multi- Glasserman, Paul, Bounds and Asymptotics for Planning
class Queueing Systems in Heavy Traffic: An Asymptot- Critical Safety Stocks, 244-257.
ic Approach Based on Distributional and Conservation Hassin, Refael and Moshe Haviv, Equilibrium Threshold
Laws, 470-487. Strategies: The Case of Queues with Priorities,
Borst, S. C. and O. J. Boxma, Polling Models With and 966-973.
Without Switchover Times, 536-543. Li, Jingwen, An Approximation Method for the Analysis
Bramel, Julien and David Simchi-Levi, On the Effective- of GI/G/1 Queues, 140-144.
ness of Set Covering Formulations for the Vehicle Rout- Pena Perez, Agnes and Paul Zipkin, Dynamic Schedul-
ing Problem with Time Windows, 295-301. ing Rules for a Multiproduct Make-to-Stock Queue,
Bukiet, Bruce, Elliotte Rusty Harold, and Jose Luis 919-930.
Palacios, A Markov Chain Approach to Baseball, 14-23.
Resnick, Sidney and Gennady Samorodnitsky, Perfor-
Chen, Fangruo and Yu-Sheng Zheng, One-Warehouse
mance Decay in a Single Server Exponential Queueing
Multiretailer Systems with Centralized Stock Informa-
Model with Long Range Dependence, 235-243.
tion, 275-287.
Sethi, Suresh P. and Feng Cheng, Optimality of (s, S)
Choudhury, Gagan L., David M. Lucantoni, and Ward
Policies in Inventory Models with Markovian Demand,
Whitt, Numerical Solution of Piecewise-Stationary
931-939.
M/G/\ Queues, 440-450.
Dai, J. G., D. H. Yeh, and C. Zhou, The QNET Method Shanthikumar, J. George and Susan H. Xu, Asymptoti-
for Re-Entrant Queueing Networks with Priority Disci- cally Optimal Routing and Service Rate Allocation in a
plines, 610-623. Multiserver Queuing System, 464-469.
Federgruen, A. and G. Mosheiov, Single Machine Sched- Stanford, David A., Waiting and Interdeparture Times in
uling Problems with General Breakdowns, Earliness Priority Queues with Poisson- and General-Arrival
and Tardiness Costs, 66-71. Streams, 725-735.
AUTHOR INDEX
A Bertsimas, Dimitris and Georgia Mourtzinou, Multi-
class Queueing Systems in Heavy Traffic: An Asymp-
Abboud, Nadim E. and John N. Daigle, A Little’s Result
totic Approach Based on _ Distributional and
Approach to the Service Constrained Spares Provision-
Conservation Laws, 470-487.
ing Problem for Repairable Items, 577-583.
Betts, Lisa M. and J. Randall Brown, Proportional Eq-
Adams, J. B. and D. S. Hochbaum, A New and Fast
uity Flow Problem for Terminal Arcs, 521-535.
Approach to Very Large Scale Integrated Sequential
Bevers, Michael, John Hof, Daniel W. Uresk, and Greg-
Circuit Test Generation, 842-856.
ory L. Schenbeck, Spatial Optimization of Prairie Dog
Aggarwal, Charu C., James B. Orlin, and Ray P. Tai,
Colonies for Black-Footed Ferret Recovery, 495-507.
Optimized Crossover for the Independent Set Problem,
Bianco, Lucio, see Mingozzi, Bianco and Ricciardelli,
226-234.
364-377.
Aggarwal, Prabhu K., see Moinzadeh and Aggarwal,
Bilge, Umit and Gunduz Ulusoy, Letter to the Editor,
694-701.
322.
Ahmadi, Reza H., Managing Capacity and Flow at
Borst, S. C. and O. J. Boxma, Polling Models With and
Theme Parks, 1-13.
Without Switchover Times, 536-543.
Alpern, Steve, see Lim, Alpern and Beck, 357-364.
Boxma, O. J., see Borst and Boxma, 536-543.
Anderson, D. R., see Helton, Anderson, Marietta and
Bramel, Julien and David Simchi-Levi, On the Effective-
Rechard, 157-177.
ness of Set Covering Formulations for the Vehicle Rout-
Atkins, Derek, see Sun, Daning and Atkins, 940-951.
ing Problem with Time Windows, 295-301.
Brandeau, Margaret L., see Thonemann and Brandeau,
B
857-873.
Barnhart, Cynthia, see Vance, Barnhart, Johnson and Brown, J. Randall, see Betts and Brown, 521-535.
Nemhuaser, 188-200. Bukiet, Bruce, Elliotte Rusty Harold, and Jose Luis
Bean, James C., see Hadj-Alouane and Bean, 92-101. Palacios, A Markov Chain Approach to Baseball,
Beck, Anatole, see Lim, Alpern and Beck, 357-364. 14-23.
Author Index: 1997 / 993
Buss, Arnold H. and Meir J. Rosenblatt, Activity Delay Fischetti, Matteo, Juan Jose Salazar Gonzalez, and Paolo
in Stochastic Project Networks, 126-139. Toth, A Branch-and-Cut Algorithm for the Symmetric
Generalized Traveling Salesman Problem, 378-394.
Cc Fisher, Marshall L., Kurt O. Jornsten, and Oli B. G.
Madsen, Vehicle Routing with Time Windows: Two
Chen, Fangruo and Yu-Sheng Zheng, One-Warehouse
Optimization Algorithms, 488-492.
Multiretailer Systems with Centralized Stock Informa-
Flynn, James and Stanley Garstka, The Optimal Review
tion, 275-287.
Period in a Dynamic Inventory Model, 736-750.
Chen, Shaoxiang, see Gochet, Stam, Srinivasan and
Chen, 213-225.
G
Cheng, Chun Hung, see Reisman, Kumar, Motwani
and Cheng, 508-520. Gallego, Guillermo and Garrett Van Ryzin, A Multi-
Cheng, Feng, see Sethi and Cheng, 931-939. product Dynamic Pricing Problem and Its Applications
Choudhury, Gagan L., David M. Lucantoni, and Ward to Network Yield Management, 24-41.
Whitt, Numerical Solution of Piecewise-Stationary Gans, Noah and Garrett van Ryzin, Optimal Control of
M/G/1 Queues, 440-450. a Multiclass, Flexible Queueing System, 677-693.
Crama, Yves and Joris van de Klundert, Cyclic Sched- Garstka, Stanley, see Flynn and Garstka, 736-750.
uling of Identical Parts in a Robotic Cell, 952-965.
Gendreau, Michel, Gilbert Laporte, and Alain Hertz,
An Approximation Algorithm for the Traveling Sales-
D
man Problem with Backhauls, 639-641.
Daigle, John N., see Abboud and Daigle, 577-583. Gendreau, Michel, Gilbert Laporte, and Frederic Se-
Dai, J. G., D. H. Yeh, and C. Zhou, The QNET Method met, The Covering Tour Problem, 568-576.
for Re-Entrant Queueing Networks with Priority Disci- Ghosh, Jay B., see De, Dunne, Ghosh and Wells,
plines, 610-623. 302-306.
Dauzere-Peres, Stephane and Jean-Bernard Lasserre, Glasserman, Paul, Bounds and Asymptotics for Planning
Lot Streaming in Job-Shop Scheduling, 584-595. Critical Safety Stocks, 244-257.
Day, Paul R. and David M. Ryan, Flight Attendant Ros- Gochet, Willy, Antonie Stam, V. Srinivasan, and Shaox-
tering for Short-Haul Airline Operations, 649-661. iang Chen, Multigroup Discriminant Analysis Using
De, Prabuddha, E. James Dunne, Jay B. Ghosh, and Linear Programming, 213-225.
Charles E. Wells, Complexity of the Discrete Time- Graves, Stephen C., see Zhang and Graves, 894-903.
Cost Tradeoff Problem for Project Networks, 302-306. Griggs, Brian J., Gregory S. Parnell, and Lee J. Leh-
Degraeve, Zeger and Linus Schrage, A Tire Production mkuhl, An Air Mission Planning Algorithm Using Deci-
Scheduling System for Bridgestone/Firestone Off-the- sion Analysis and Mixed Integer Programming, 662-676.
Road, 789-796. Giirler, Ulkii and Mahmut Parlar, An Inventory Prob-
Deichtmann, Jean M. and Francois Sainfort, On the lem with Two Randomly Available Suppliers, 904-918.
Difference Between the Cardinalities of Measurable
Value Functions and von Neumann-Morgenstern Utility H
Functions, 307-308.
Ha, Albert Y., Optimal Dynamic Scheduling Policy for a
Demeulemeester, Erik L. and Willy S. Herroelen, A
Make-to-Stock Production System, 42-53.
Branch-and-Bound Procedure for the Generalized
Hadj-Alouane, Ben Atidel and James C. Bean, A Ge-
Resource-Constrained Project Scheduling Problem,
netic Algorithm for the Multiple-Choice Integer Pro-
201-212.
gram, 92-101.
Dunne, James, see De, Dunne, Ghosh and Wells,
302-306. Hall, Nicholas G., Hichen Kamoun, and Chelliah Sris-
kandarajah, Scheduling in Robotic Cells: Classifica-
E tion, Two and Three Machine Cells, 421-439.
Hall, L. A., see Williamson, Hall, Hoogeveen, Hurkens,
Eppen, Gary D. and Ananth. V. Iyer, Improved Fashion Lenstra, Sevast’janov and Shmoys, 288-294.
Buying with Bayesian Updates, 805-819.
Harold, Elliotte Rusty, see Bukiet, Harold and Pala-
cios, 14-23.
F
Hassin, Refael and Moshe Haviv, Equilibrium Threshold
Federgruen, A. and G. Mosheiov, Single Machine Sched- Strategies: The Case of Queues with Priorities,
uling Problems with General Breakdowns, Earliness 966-973.
and Tardiness Costs, 66-71. Haviv, Moshe, see Hassin and Haviv, 966-973.
Federgruen, Awi and Garrett van Ryzin, Probabilistic Helton, J. C., D. R. Anderson, M. G. Marietta, and
Analysis of a Generalized Bin Packing Problem and R. P. Rechard, Performance Assessment for the Waste
Applications, 596-609. Isolation Pilot Plant, 157-177.
994 / INDICES TO VOLUME 45: 1997
Herer, Yale and Robin Roundy, Heuristics for a One- Kumar, Ashok, see Reisman, Kumar, Motwani and
Warehouse Multiretailer Distribution Problem with Per- Cheng, 508-520.
formance Bounds, 102-115.
Herroelen, Willy S., see Demeulemeester and Herro- L
elen, 201-212.
Landy, Dan, see Hochbaum and Landy, 874-885.
Hertz, Alain, see Gendreau, Laporte and Hertz,
Laporte, Gilbert, see Gendreau, Laporte and Hertz,
639-641.
639-641.
Hochbaum, D. S., see Adams and Hochbaum, 842-856.
Laporte, Gilbert, see Gendreau, Laporte and Semet,
Hochbaum, Dorit S. and Dan Landy, Scheduling Semi-
568-576.
conductor Burn-In Operations to Minimize Total Flow-
Lasserre, Jean-Bernard, see Dauzere-Peres and
time, 874-885.
Lasserre, 584-595.
Hodgson, Thom J., Russell E. King, and Paul M. Stan-
Lederer, Phillip J. and Lode Li, Pricing, Production,
field, Ready-Time Scheduling with Stochastic Service
Scheduling, and Delivery-Time Competition, 407-420.
Times, 779-783.
Lee, Chung-Yee and George L. Vairaktarakis, Work-
Hof, John, see Bevers, Hof, Uresk and Schenbeck,
force Planning in Mixed Model Assembly Systems,
495-507.
553-567.
Hoogeveen, J. A., see Williamson, Hall, Hoogeveen,
Lee, Tae-Eog and Marc E. Posner, Performance Mea-
Hurkens, Lenstra, Sevast’janov and Shmoys,
sures and Schedules in Periodic Job Shops, 72-91.
288-294.
Lehmkuhl, Lee J., see Griggs, Parnell and Lehmkuhl,
Hopp, Wallace J., Mark L. Spearman, and Rachel Q.
662-676.
Zhang, Easily Implementable Inventory Control Poli-
Lenstra, J. K., see Williamson, Hall, Hoogeveen,
cies, 327-340.
Hurkens, Lenstra, Sevast’?janov and Shmoys,
Hurkens, C. A. J., see Williamson, Hall, Hoogeveen,
288-294.
Hurkens, Lenstra, Sevast’janov and Shmoys,
Li, Jingwen, An Approximation Method for the Analysis
288-294.
of GI/G/1 Queues, 140-144.
I Li, Lode, see Lederer and Li, 407-420.
Lim, Wei Shi, Steve Alpern, and Anatole Beck, Rendez-
Iyer, Ananth. V., see Eppen and Iyer, 805-819. vous Search on the Line with More Than Two Players,
357-364.
J
Lippman, Steven A. and Kevin F. McCardle, The Com-
petitive Newsboy, 54-65.
Johnson, Ellis L., see Vance, Barnhart, Johnson and
Nemhauser, 188-200. Lucantoni, David M., see Choudhury, Lucantoni and
Jornsten, Kurt O., see Fisher, Jornsten and Madsen, Whitt, 440-450.
488-492.
Jurisch, Bernd and Wieslaw Kubiak, Two-Machine M
Open Shops with Renewable Resources, 544-552.
Madsen, Oli B. G., see Fisher, Jornsten and Madsen,
488-492.
K
Madsen, Oli B. G., see Kohl and Madsen, 395-406.
Kamoun, Hichen, see Hall, Kamoun and Sriskandara- Marietta, M. G., see Helton, Anderson, Marietta and
jah, 421-439. Rechard, 157-177.
King, Russell E., see Hodgson, King and Stanfield, Martello, Silvano and Paolo Toth, Upper Bounds and
779-783. Algorithms for Hard 0-1 Knapsack Problems, 768-778.
Kiossis, Ioannis, see Omerod and Kiossis, 178-187. Mazzola, Joseph B. and Kevin F. McCardle, The Sto-
Kohl, Niklas and Oli B. G. Madsen, An Optimization chastic Learning Curve: Optimal Production in the
Algorithm for the Vehicle Routing Problem with Time Presence of Learning-Curve Uncertainty, 440-450.
Windows Based on Lagrangian Relaxation, 395-406. McCardle, Kevin F., see Lippman and McCardle,
Konig, Jean-Claude, see Munier and Konig, 145-152. 54-65.
Korhonen, Pekka, Seppo Salo, and Ralph E. Steuer, A McCardle, Kevin F., see Mazzola and McCardle,
Heuristic for Estimating Nadir Criterion Values in Mul- 440-450.
tiple Objective Linear Programming, 751-757. McGavin, Edward J., James E. Ward, and Leroy B.
Kouvelis, Panagiotis, see Mukhopadhyay and Kouvelis, Schwarz, A Branch-and-Price Algorithm for the Gener-
886-893. alized Assignment Problem, 820-830.
Kroon, Leo G., Marc Salomon, and Luk N. van Was- Mingozzi, Aristide, Lucio Bianco, and Salvatore Ric-
senhove, Exact and Approximation Algorithms for the ciardelli, Dynamic Programming Strategies for the
Tactical Fixed Scheduling Problem, 624-638. Traveling Salesman Problem with Time Window and
Kubiak, Wieslaw, see Jurisch and Kubiak, 544-552. Precedence Constraints, 364-377.
Author Index: 1997 / 995
Mireault, Paul, James B. Orlin, and Rakesh V. Vohra, Pritsker, A. Alan B., Modeling in Performance-
A Parametric Worst Case Analysis of the LPT Heuristic Enhancing Processes, 797-804.
for Two Uniform Machines, 116-125.
Moinzadeh, Kamran and Prabhu K. Aggarwal, An In- R
formation Based Multiechelon Inventory System with
Rechard, R. P., see Helton, Anderson, Marietta and
Emergency Orders, 694-701.
Rechard, 157-177.
Moinzadeh, Kamran, see Nahmias and Moinzadeh,
Reisman, Arnold, Ashok Kumar, Jaideep Motwani, and
974-986.
Chun Hung Cheng, Cellular Manufacturing: A Statis-
Mosheiov, G., see Federgruen and Mosheiov, 66-71.
tical Review of the Literature, 508-520.
Motwani, Jaideep, see Reisman, Kumar, Motwani and
Resnick, Sidney and Gennady Samorodnitsky, Perfor-
Cheng, 508-520.
mance Decay in a Single Server Exponential Queueing
Mourtzinou, G., see Bertsimas and Mourtzinou,
Model with Long Range Dependence, 235-243.
470-487.
Ricciardelli, Salvatore, see Mingozzi, Bianco and Ric-
Mukhopadhyay, Samar K. and Panagiotis Kouvelis, A
ciardelli, 364-377.
Differential Game Theoretic Model for Duopolistic
Rosenblatt, Meir J., see Buss and Rosenblatt, 126-139.
Competition on Design Quality, 886-893.
Roundy, Robin, see Herer and Roundy, 102-115.
Munier, Alix and Jean-Claude Konig, A Heuristic for a
Ryan, David M., see Day and Ryan, 649-661.
Scheduling Problem with Communication Delays,
145-152.
S
Murphy, Frederic H. and Venkat Panchanadam, Under-
standing Linear Program Modeling Through an Exam- Sainfort, Francois, see Deichtmann and Sainfort,
ination of the Early Papers on Model Formulation, 307-308.
341-356. Salazar Gonzalez, Juan Jose, see Fischetti, Salazar
gonzalez and Toth, 378-394.
N Salo, Seppo, see Korhonen, Salo and Steuer, 751-757.
Salomon, Marc, see Kroon, Salomon and van Wassen-
Nahmias, Steven and Kamran Moinzadeh, Lot Sizing
hove, 624-638.
with Randomly Graded Yields, 974-986.
Samaratunga, Chand, Suresh P. Sethi, and Xun Yu
Nemhauser, George L., see Vance, Barnhart, Johnson Zhou, Computational Evaluation of Hierarchical Pro-
and Nemhauser, 188-200. duction Control Policies for Stochastic Manufacturing
Nurani, Raman K., Sridhar Seshadri, and J. George Systems, 258-274.
Shanthikumar, Optimal Control of a Single Stage Pro-
Samorodnitsky, Gennady, see Resnick and Samorid-
duction System Subject to Random Process Shifts,
nitsky, 235-243.
713-724.
Savelsbergh, Martin, A Branch-and-Price Algorithm for
the Generalized Assignment Problem, 831-841.
O
Schenbeck, Gregory L., see Bevers, Hof, Uresk and
Omerod, Richard and Ioannis Kiossis, OR/MS Publica- Schenbeck, 495-507.
tions: Extensions of the Analysis of U.S. Flagship Jour- Schrage, Linus, see Degraeve and Schrage, 789-796.
nals to the United Kingdom, 178-187. Schwarz, Leroy B., see McGavin, Ward and Schwarz,
Orlin, James B., see Aggarwal, Orlin and Tai, 226-234. 820-830.
Orlin, James B., see Mireault, Orlin and Vohra, Semet, Frederic, see Gendreau, Laporte and Semet,
116-125. 568-576.
Seshadri, Sridhar, see Nurani, Seshadri and Shanthi-
kumar, 713-724.
P
Seshadri, Sridhar and J. G. Shanthikumar, Allocation
Palacios, Jose Luis, see Bukiet, Harold and Palacios, of Chips to Wafers in a Production Problem of Semi-
14-23. conductor Kits, 315-321.
Panchanadam, Venkat, see Murphy and Panchanadam, Sethi, S. P., see Wang, Sethi and van de Velde, 702-712.
341-356. Sethi, Suresh P., see Samaratunga, Sethi and Zhou,
Parlar, Mahmut, see Gurler and Parlar, 904-918. 258-274.
Parnell, Gregory S., see Griggs, Parnell and Lehmkuhl, Sethi, Suresh P. and Feng Cheng, Optimality of (s, S)
662-676. Policies in Inventory Models with Markovian Demand,
Pefia Perez, Agnes and Paul Zipkin, Dynamic Schedul- 931-939.
ing Rules for a Multiproduct Make-to-Stock Queue, Sevast’janov, S. V., see Williamson, Hall, Hoogeveen,
919-930. Hurkens, Lenstra, Sevast’janov and Shmoys,
Pisinger, David, A Minimal Algorithm for the 0-1 Knap- 288-294.
sack Problem, 758-767. Shanthikumar, J. G., see Seshadri and Shanthikumar,
Posner, Marc E., see Lee and Posner, 72-91. 315-321.
996 / INDICES TO VOLUME 45: 1997
Shanthikumar, J. George, see Nurani, Seshadri and Van de Klundert, Joris, see Crama and van de Klun-
Shanthikumar, 713-724. dert, 952-965.
Shanthikumar, J. George and Susan H. Xu, Asymptoti- Van de Velde, S. L., see Wang, Sethi and van de Velde,
cally Optimal Routing and Service Rate Allocation in a 702-712.
Multiserver Queuing System, 464-469. Van Ryzin, Garrett, sec Federgruen and van Ryzin,
Sharifnia, Ali, /nstability of the Join-the-Shortest-Queue 596-609.
and FCFS Policies in Queuing Systems and Their Sta- Van Ryzin, Garrett, see Gallego and van Ryzin, 24-41.
bilization, 309-314. Van Ryzin, Garrett, see Gans and van Ryzin, 677-693.
Shmoys, D. B., see Williamson, Hall, Hoogeveen, Van Wassenhove, Luk N., see Kroon, Salomon and van
Hurkens, Lenstra, Sevast’janov and Shmoys, Wassenhove, 624-638.
288-294.
Vance, Pamela H., Cynthia Barnhart, Ellis L. Johnson,
Simchi-Levi, David, see Julien Bramel, 295-301.
and George L. Nemhauser, Airline Crew Scheduling:
Spearman, Mark L., see Hopp, Spearman and Zhang,
A New Formulation and Decomposition Algorithm,
327-340.
188-200.
Srinivasan, V., see Gochet, Stam, Srivinivasan and
Vohra, Rakesh V., see Mireault, Orlin and Vohra,
Chen, 213-225.
116-125.
Sriskandarajah, Chelliah, see Hall, Kamoun and Sris-
kandarajah, 421-439.
Ww
Stam, Antonie, see Gochet, Stam, Srinivasan and Chen,
213-225. Wang, M. Y., S. P. Sethi, and S. L. van de Velde, Minimiz-
Stanfield, Paul M., see Hodgson, King and Stanfield, ing Makespan in a Class of Reentrant Shops, 702-712.
779-783. Ward, James E., see McGavin, Ward and Schwarz,
Stanford, David A., Waiting and Interdeparture Times in 820-830.
Priority Queues with Poisson- and General-Arrival
Wells, Charles E., see De, Dunne, Ghosh and Wells,
Streams, 725-735.
302-306.
Steuer, Ralph E., see Korhonen, Salo and Steuer,
Whitt, Ward, see Choudhury, Lucantoni and Whitt,
751-757.
440-450.
Sun, Daning and Derek Atkins, 98%-Effective Lot-Sizing
Williamson, D. P., L. A. Hall, J. A. Hoogeveen, C. A. J.
for Assembly Inventory Systems with Backlogging,
Hurkens, J. K. Lenstra, S. V. Sevast’janov, and D. B.
940-951.
Shmoys, Short Shop Schedules, 288-294.
T
X
Tai, Ray P., see Aggarwal, Orlin and Tai, 226-234.
Xu, Susan H., see Shanthikumar and Xu, 464-469.
Thonemann, Ulrich W. and Margaret L. Brandeau, De-
signing a Zoned Automated Guided Vehicle System with
Multiple Vehicles and Multiple Load Capacity, 857-873. ¥
Toth, Paolo, see Fischetti, Salazar Gonzalez and Toth, Yeh, D. H., see Dai, Yeh and Zhou, 610-623.
378-394.
Toth, Paolo, see Martello and Toth, 768-778. Z
U Zhang, Hongtao and Stephen C. Graves, Cyclic Sched-
uling in a Stochastic Environment, 894-903.
Ulusoy, Gunduz, see Bilge and Ulusoy, 322. Zhang, Rachel Q., see Hopp, Spearman and Zhang,
Uresk, Daniel W., see Bevers, Hof, Uresk and Schen- 327-340.
beck, 495-507.
Zheng, Yu-Sheng, see Chen and Zheng, 275-287.
Zhou, C., see Dai, Yeh and Zhou, 610-623.
Vv
Zhou, Xun Yu, see Samaratunga, Sethi and Zhou,
Vairaktarakis, George L., see Lee and Vairaktarakis, 258-274.
553-567. Zipkin, Paul, see Peta Perez and Zipkin, 919-930.
SUBJECT INDEX
The subject index conforms to the categories established in the OR/MS Index, 1952-1976, 1976-1981, and 1982-1987. The
1952-1976 cumulative index was compiled by Kneale T. Marshall and F. Russell Richards, the 1976-1981 cumulative index
was compiled by Jon W. Tolle and Richard E. Stone, and the 1982-1987 cumulative index was compiled by Jon W. Tolle.
Subject Index: 1997 / 997
The indices were published in 1978, 1983 and 1988 by The Institute of Management Sciences and the Operations Research
Society of America. The index was renamed the Annual Comprehensive Index and is available at www.informs.org.
Algorithms, analysis of Inventory, multiechelon
De, P., computational complexity, strong NP-complete McGavin, E. J., optimality of allocation policies,
ness, 302-306. 820-830.
Federgruen, A., probabilistic, 596-609. Moinzadeh, K., emergency replenishments, 694-701.
Gendreau, M., combinatorial problems, 639-641. Inventory, perishable
Jurisch, B., computational complexity, 544-552. Lippman, S. A., one-period newsboy problem, 54-65.
Kroon, L. G., computational complexity, 624-638. Inventory, policy
Approximations/heuristics Moinzadeh, K., order-for-order policies, 694-701.
Munier, A., continuous relaxation of an integer linear Inventory/production
program, 145-152. Chen, F., echelon-stock, batch-transfer policies, non-
Backlogging identical retailers, stochastic: compound Poisson de-
Sun, D., 940-951. mand, continuous review, 275-287.
Computer/cs-artificial intelligence Eppen, G. D., stochastic models, Bayesian updates,
Hadj-Alouane, A. B., genetic algorithms, 92-101. 805-819.
Decision analysis Flynn, J., optimal review period; policies: periodic re-
Griggs, B. J., applications: influence diagrams and de- view; stochastic inventory model, 736-750.
cision trees, 662-676. Glasserman, P., service level approximations, 244-257.
Helton, J. C., risk, performance assessment for radio- Giirler, U., supplier uncertainty, 904-918.
active waste disposal, 157-177. Ha, A. Y., optimal control policies, 42-53.
Deterministic, multiple machine sequencing Herer, Y., multi-item/echelon/stage: bounds hold for
Hall, N. G., optimal sequence of robot movements general production/distribution network, 102-115.
and parts, 421-439. Hopp, W. J., approximation/heuristics, multi-item,
Dynamic programming 327-340.
Crama Y., deterministic: traveling salesman, pyrami- Nahmias, S., stochastic: one-way substitutions, 974-986.
dal permutations, 952-965. Nurani, R. K., optimal inventory, zero inventory, qual-
Gallego, G., intensity control, 24-41. ity, process shifts, 713-724.
Ha, A. Y., optimal control applications, 42-53. Seshadri, S., random yields, product design, 315-321.
Herer, Y., optimal control, applications, optimal Sun, D., multiechelon lot sizing, 940-951.
power of two schedule for one warehouse problem, Manufacturing, automated systems
102-115. Crama Y., materials handling in robotic cells,
Hochbaum, D. S., applications: scheduling semicon- 952-965.
ductor burn-in operations, 874-885. Manufacturing performance
Mazzola, J. B., modeling, 440-450. Abboud, N. E., optimal number of machines, 577-583.
Mingozzi, A., optimal control: state space relaxation Adams, J. B., productivity, improved quality control
strategies, 365-377. by effective testing, 842-856.
Nurani, R. K., control, Markov, 713-724. Mukhopadhyay, S. K., strategy, quality management,
Pisinger, D., knapsack problem, 758-767. 886-893.
Samaratunga, C., optimal control/finite state Markov, Mathematics
manufacturing with unreliable machines, computa- Day, P. R., combinatorics; set partitioning, 649-661.
tion of MDP, 258-274. Military, targeting
Games, noncooperative Griggs, B. J., theater level air mission planning, 662-676.
Lippman, S. A., strategic, competitive, inventory lev- Natural resources
els, 54-65. Bevers, M., habitat allocation for endangered species
Mukhopadhyay, S. K., differential, 886-893. recovery, 495-507.
Government, regulations Networks/graphs
Helton, J. C., application of 40 CFR 191.13 to Waste Aggarwal, C. C., heuristic, optimized crossover for in-
Isolation Pilot Plant, 157-177. dependent set problem, 226-234.
Industries Betts, L. M., flow algorithms: proportional equity flow
Adams, J. B., computer: semiconductor, 842-856. problems, 521-535.
Seshadri, S., semiconductor, 315-321. Demeulemeester, E. L., precedence diagramming,
Inventory models 201-212.
Sethi, S. P., Markovian demand, optimality of (s, S) Fischetti, M., general traveling salesman, 378-394.
policies, fixed ordering costs, 931-939. Fisher, M. L., tree algorithms, 488-492.
998 / INDICES TO VOLUME 45: 1997
Hodgson, T. J., stochastic: shop modeled as stochastic Williamson, D. P., multiple machine deterministic:
networks, 779-783. nonpreemptive shop scheduling, 288-294.
Lee, T.-E., applications, 72-91. Zhang, H., stochastic cyclic schedules, 894-903.
Mingozzi, A., traveling salesman with additional con- Production scheduling, approximations
straints, 365-377. Gans, N., heuristics: job shops, flexible manufactur-
Optimal control ing/service systems, dynamic resource allocation,
Mukhopadhyay, S. K., applications, 886-893. 677-693.
Philosophy of modeling Kroon, L. G., heuristics, 624-638.
Pritsker, A. A. B., relation to scientific method, Lee, C.-Y., heuristic, sequencing/deterministic appli-
797-804. cations, 553-567.
Probability Samaratunga, C., heuristics, hierarchical decision
Bevers, M., diffusion: dynamic spatial population opti- making, asymptotic optimality, 258-274.
mization, 495-507. Williamson, D. P., impossibility results, 288-294.
Borst, S. C., stochastic model applications, queue Professional, OR/MS education
length and waiting time distribution in polling mod- Ormerod, R., meta research, 178-187.
els, 536-543. Professional, OR/MS philosophy
Glasserman, P., applications: rare events, 244-257. Ormerod, R., research on research, epistemology of
Giirler, U., stochastic model applications, 904-918.
management science, 178-187.
Hodgson, T. J., STD chastic models: service time data Reisman, A., meta research on cellular manufactur-
probabilistically distributed, 779-783. ing, 508-520.
Li, J., distributions, analysis of idle-period distribu-
Programming
tion of GI/G/1 queues, 140-144.
Demeulemeester, E. L., banch-and-bound, 201-212.
Seshadri, S., stochastic model applications, 315-321.
Fisher, M. L., relaxation, subgradient, 488-492.
Shanthikumar, J. G., stochastic model applications, Kohl, N., relaxation/subgradient, nondifferentiable, 395-
464-469. 406.
Probability, Markov processes Korhonen, P., multiple criteria: Nadir solution, 751-757.
Bukiet, B., Markov process to model baseball, 14-23. Kroon, L. G., integer, 624-638.
Production, learning Programming, integer
Mazzola, J. B., optimal policies with stochastic learn- Aggarwal, C. C., heuristic, optimized crossover for in-
ing curve; planning, 440-450. dependent set problem, 226-234.
Production/scheduling Bramel, J., applications: linear relaxations, 295-301.
Bilge, U., flexible manufacturing: simultaneous sched- Degraeve, Z., algorithms, decomposition: Dantzig-
uling of machines and AGVs, 322. Wolfe, 789-796.
Crama, Y., sequencing: flow shop, cycle time minimi- Fischetti, M., branch-and-cut algorithm, 378-394.
zation, 952-965. Gendreau, M., integer applications, 568-576.
Dauzere-Peres, S., sequencing, lot streaming, 584-595. Griggs, B. J., assignment of aircraft and weapons to
Degraeve, Z., applications, planning, 789-796. targets, 662-676.
Federgruen, A., stochastic, 66-71. Martello, S., algorithms, branch-and-bound, 0-1 knap-
Federgruen, A., bin packing/cutting stock, 596-609. sack problem; relaxation/subgradient: valid inequali-
Ha, A. Y., sequencing in a stochastic system, 42-53. ties, Lagrangian relaxations, 768-778.
Hall, N. G., minimizing cycle time in robot-served Pisinger, D., algorithms, dynamic programming algo-
machine cells, 421-439. rithm for knapsack problem, 758-767.
Hochbaum, D. S., applications: semiconductor burn-in Savelsbergh, M., optimization algorithm for the GAP,
operations, 874-885. 831-841.
Hodgson, T. J., stochastic sequencing probabilities; Programming, integer-heuristic
scheduling facilities with stochastic service, 779-783. Adams, J. B., heuristic approach for the four cover
Jurisch, B., open shop, resource constraints, 544-552. problem, 842-856.
Lederer, P. J., time-based competition, 407-420. Hadj-Alouane, A. B., convergent genetic algorithm,
Munier, A., precedence constraints, interprocessor 92-101.
communication delays, 145-152. Programming, integer-theory
Nahmias, S., random grading after production, Hadj-Alouane, A. B., strong duality, 92-101.
974-986. Programming, linear applications
Reisman, A., research on research, 508-520. Bevers, M., a black-footed ferret case study from
Sharifnia, A., instability of join-the-shortest queue South Dakota, 495-507.
and FCFS policies, 309-314. Gochet, W., applications, 213-225.
Wang, M. Y., deterministic, reentrant shop schedul- Korhonen, P., nonconvex set, 751-757.
ing, 702-712. Murphy, F. J., early linear program models, 341-356.