Naval Research Logistics (NRL)

1987 - 2021

From John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 37, issue 6, 1990

Optimization in simulation: Current issues and the future outlook pp. 807-825

M. Hossein Safizadeh

An approach to modeling electric utility capacity expansion planning pp. 827-845

Frederic H. Murphy and Howard J. Weiss

When is greedy module assembly optimal? pp. 847-854

David M. Malon

A periodic maintenance model with used equipment and random minimal repair pp. 855-865

D. Ait Kadi, C. Beaucaire and R. Cléroux

The discrete evasion game with three‐move lag pp. 867-874

L. Y. Lee and K. T. Lee

Design and estimation for small sample sensitivity testing pp. 875-892

Barry A. Bodt and Henry B. Tingey

Cost effectiveness of using a correlated variable in a complete inspection plan when inspection error is present pp. 893-904

Kwei Tang and Helmut Schneider

Economic design of sampling plans with multi‐decision alternatives pp. 905-918

Do Sun Bai and Sung Hoon Hong

Economic screening procedures in logistic and normal models pp. 919-928

Sang Boo Kim and Do Sun Bai

Queueing‐location problems on the plane pp. 929-935

Zvi Drezner, Siegfried Schaible and David Simchi‐Levi

Analysis of a bicriteria location model pp. 937-944

Adel A. Aly and Boubekeur Rahali

Floor layouts using a multifacility location model pp. 945-952

Paul D. Dowling and R. F. Love

An interactive aid for descriptive multiattribute problems pp. 953-959

Gary Klein

Convergence properties of the modified subgradient method of camerini et al pp. 961-966

Sehun Kim and Hyunsil Ahn

Lower bounds for single‐machine scheduling problems pp. 967-979

Reza H. Ahmadi and Uttarayan Bagchi

Multiobjective flow‐shop scheduling pp. 981-995

Richard L. Daniels and Robert J. Chambers

Volume 37, issue 5, 1990

Multiobserver multitarget visibility probabilities for poisson shadowing processes in the plane pp. 603-615

M. Yadin and S. Zacks

Some conditions for stochastic equality pp. 617-625

Marco Scarsini and Moshe Shaked

A cusum procedure based on sequential ranks pp. 627-646

David McDonald

Incomplete identification models for group‐testable items pp. 647-659

Shaul K. Bar‐Lev, Arnon Boneh and David Perry

Single‐machine scheduling subject to stochastic breakdowns pp. 661-677

John Birge, J. B. G. Frenk, J. Mittenthal and A. H. G. Rinnooy Kan

Cyclic sequencing problems in the two‐machine permutation flow shop: Complexity, worst‐case, and average‐case analysis pp. 679-694

Hirofumi Matsuo

Heuristic algorithms for continuous flow‐shop problem pp. 695-705

Chandrasekharan Rajendran and Dipak Chaudhuri

The dynamic lot size model with quantity discount pp. 707-713

Awi Federgruen and Chung‐Yee Lee

On the optimality of the (S — 1,S) policy pp. 715-723

Carl R. Schultz

Safety stock reduction by order splitting pp. 725-743

Péter Kelle and Edward A. Silver

Asymptotic normality of the estimated optimal order quantity for one‐period inventories with supply uncertainty pp. 745-751

Sujit K. Basu and Rahul Mukerjee

Diffusion approximation to the G/G/R machine repair problem with warm standby spares pp. 753-772

B. D. Sivazlian and K. H. Wang

The shortest queue model with jockeying pp. 773-787

Yiqiang Zhao and W. K. Grassmann

Unbalanced production line scheduling with partial job specialization pp. 789-805

Wafik H. Iskander and Jar Chou

Volume 37, issue 4, 1990

Introduction special issue on global optimization pp. 431-432

S. Selcuk Erenguc and A. Victor Cabot

Deterministic methods in constrained global optimization: Some recent advances and new fields of application pp. 433-471

Reiner Horst

The relief indicator method for constrained global optimization pp. 473-497

Phan Thiên Thach and Hoàng Tuy

Guaranteed ϵ‐approximate solution for indefinite quadratic global minimization pp. 499-514

A. T. Phillips and J. B. Rosen

An algorithm for concave integer minimization over a polyhedron pp. 515-525

Harold P. Benson and S. Selcuk Erenguc

An algorithm for quadratic zero‐one programs pp. 527-538

Bahman Kalantari and Ansuman Bagchi

A multifamily dynamic lot‐sizing model with coordinated replenishments pp. 539-558

S. Selcuk Erenguc and H. Murat Mercan

A simulated annealing approach to scheduling a manufacturing cell pp. 559-577

Asoo J. Vakharia and Yih‐Long Chang

Solving production smoothing problems with a nonlinear candidate constraint method pp. 579-586

Jonathan D. Stanley and Awanti P. Sethi

A note on the generalized due dates scheduling problems pp. 587-597

C. Sriskandarajah

Volume 37, issue 3, 1990

Yield randomness, cost tradeoffs, and diversification in the EOQ model pp. 341-354

Yigal Gerchak and Mahmut Parlar

On ruckle's game of ambush pp. 355-363

K. T. Lee

Multiple finite source queueing model with dynamic priority scheduling pp. 365-381

Phadhana Tosirisuk and Jeya Chandra

Split delivery routing pp. 383-402

Moshe Dror and Pierre Trudeau

An interactive branch‐and‐bound algorithm for bicriterion nonconvex/mixed integer programming pp. 403-417

Yasemin Aksoy

Rectilinear m‐Center problem pp. 419-427

M. T. Ko, R. C. T. Lee and J. S. Chang

Volume 37, issue 2, 1990

A correspondence principle for relative entropy minimization pp. 191-202

Donald E. Brown and Robert L. Smith

Design and performance analysis of consecutive‐K‐out‐of‐n structure pp. 203-230

Mingjian Zuo and Way Kuo

An assignment problem with queueing time cost pp. 231-244

Saligrama R. Agnihothri, Sridhar Narasimhan and Hasan Pirkul

Formulating processing network models: Viability theory pp. 245-261

John W. Chinneck

An interactive MCDM weight space reduction method utilizing a tchebycheff utility function pp. 263-277

Robert F. Dell and Mark H. Karwan

A bard‐type method for a generalized linear complementarity problem with a nonsingular m‐matrix pp. 279-297

J. J. Júdice and F. M. Pires

An analysis of six greedy selection rules on a class of zero‐one integer programming models pp. 299-307

G. Edward Fox and Christopher J. Nachtsheim

A minimum‐length covering subtree of a tree pp. 309-326

Tae Ung Kim, Timothy J. Lowe, James E. Ward and Richard L. Francis

A relaxation/decomposition algorithm for the fixed charged network problem pp. 327-340

Bala Shetty

Volume 37, issue 1, 1990

Priority repair and dispatch policies for reparable‐item logistics systems pp. 1-30

David F. Pyke

Lanchester attrition of interpenetrating forces pp. 31-59

D. Willard

Solving resource‐constrained project scheduling problems by a* search pp. 61-84

Colin E. Bell and Kwangho Park

Control of input and demand rates in inventory systems of perishable commodities pp. 85-97

D. Perry and M. J. M. Posner

Scheduling tasks with failure probabilities to minimize expected cost pp. 99-109

Mordechai I. Henig and David Simchi‐Levi

Worst‐case analysis of local search heuristics for the one‐machine total tardiness problem pp. 111-121

Shiwei Chang, Hirofumi Matsuo and Guochun Tang

Queues served in cyclic order with an arbitrary start‐up distribution pp. 123-133

S. W. Fuhrmann and A. Moon

Relations between the prearrival and postdeparture state probabilities and the fcfs waiting time distribution in the Ek/G/s queue pp. 135-149

Xenophon Papaconstantinou and Dimitris Bertsimas

A lagrangian heuristic for set‐covering problems pp. 151-164

John Beasley

Optimal file allocation and report assignment in distributed information networks pp. 165-181

R. Ramesh and B. Ryan