Printed from https://ideas.repec.org/s/wly/navres7.html
Content
March 1998, Volume 45, Issue 2
- 165-186 Optimal lot sizing and inspection policy for an EMQ model with imperfect inspections
by Viliam Makis - 187-204 Optimal control policies for a periodic review inventory system with emergency orders
by Chi Chiang & Genaro J. Gutierrez - 205-218 Some comparison results of system availability
by Jie Mi - 219-230 Improved upper bounds for the reliability of d‐dimensional consecutive‐k‐out‐of‐n : F systems
by Anant P. Godbole & Laura K. Potter & Jessica K. Sklar - 231-242 Minimizing total completion time in two‐processor task systems with prespecified processor allocations
by Xiaoqiang Cai & Chung‐Yee Lee & Chung‐Lun Li
February 1998, Volume 45, Issue 1
- 1-22 Attrition models of the Ardennes campaign
by Ronald D. Fricker - 23-50 Matrix‐geometric solution of discrete time MAP/PH/1 priority queue
by Attahiru Sule Alfa - 51-66 Openshop scheduling under linear resources constraints
by I. Adiri & O. Hamberg - 67-82 Scheduling to minimize the total compression and late costs
by T.C.E. Cheng & Zhi‐Long Chen & Chung‐Lun Li & B.M.‐T. Lin - 83-98 Pareto‐optimality in classical inventory problems
by J. Puerto & F.R. Fernández - 99-113 Single machine sequencing with linear models of release dates
by Adam Janiak - 115-123 Estimating reliability of components with increasing failure rate using series system data
by Paul H. Kvam & Harshinder Singh
December 1997, Volume 44, Issue 8
- 699-717 The effect of training data set size and the complexity of the separation function on neural network classification capability: The two‐group case
by Moshe Leshno & Yishay Spector - 719-740 Labor staffing and scheduling models for controlling service levels
by Gary M. Thompson - 741-755 An application of the MTP2 property on bounds on system reliability
by J. Gåsemyr & B. Natvig - 757-774 A dynamic‐programming approach to continuous‐review obsolescent inventory problems
by Israel David & Eitan Greenshtein & Avraham Mehrez - 775-790 Strong turnpike policies in the single‐item capacitated lot‐sizing problem with periodical dynamic parameter
by Stanislaw Bylka - 791-806 An optimal recursive method for various inventory replenishment models with increasing demand and shortages
by Jinn‐Tsair Teng & Maw‐Sheng Chern & Hui‐Ling Yang
October 1997, Volume 44, Issue 7
- 613-622 Optimality of the greedy shooting strategy in the presence of incomplete damage information
by Gad Manor & Moshe Kress - 623-637 Testing or fault‐finding for reliability growth: A missile destructive‐test example
by D.P. Gaver & P.A. Jacobs - 639-654 Optimal nonmyopic gambling strategy for the generalized Kelly criterion
by S. Cetinkaya & M. Parlar - 655-671 A nonparametric Bayes approach to decide system burn‐in time
by Wei‐Ting Kary Chien & Way Kuo - 673-686 Average‐case analysis of the bin‐packing problem with general cost structures
by Julien Bramel & WanSoo T. Rhee & David Simchi‐Levi - 687-697 An engagement model to optimize defense against a multiple attack assuming perfect kill assessment
by Bao U. Nguyen & Peter A. Smith & Du Nguyen
September 1997, Volume 44, Issue 6
- 515-530 Acceptance sampling, imperfect production, and the optimality of zero defects
by S. Andrew Starbird - 531-557 Scheduling stochastic jobs with asymmetric earliness and tardiness penalties
by X. Cai & S. Zhou - 559-576 Algorithms for computing waiting time distributions under different queue disciplines for the D‐BMAP/PH/1
by Imed Frigui & Attahiru Sule Alfa & Xiaoyi Xu - 577-589 Cyclical schedules for the joint replenishment problem with dynamic demands
by Ian R. Webb & Bruce R. Buzby & Gerard M. Campbell - 591-603 Variable sampling plans for normal distribution indexed by Taguchi's loss function
by Ikuo Arizono & Akihiro Kanagawa & Hiroshi Ohta & Kyouko Watakabe & Kouji Tateishi - 605-611 Note: Minimizing the variability of the waiting times in a globally gated elevator polling system
by Laurence A. Baxter & Farid Harche & Uri Yechiali
August 1997, Volume 44, Issue 5
- 401-418 Minimum cost component test plans for evaluating reliability of a highly reliable parallel system
by Jayant Rajgopal & Mainak Mazumdar - 419-437 Efficient methods for sequencing minimum job sets on mixed model assembly lines
by Ahmet Bolat - 439-456 Markov decision processes with restricted observations: Finite horizon case
by Yasemin Serin & Zeynep Muge Avsar - 457-472 Stock‐rationing policy for a make‐to‐stock production system with two priority classes and backordering
by Albert Y. Ha - 473-483 Meeting seasonal demand for products with limited shelf lives
by Danny C. Myers - 485-505 Routing in packet‐switched communication networks with different criticality classes of communicating node pairs
by Ali Amiri & Hasan Pirkul - 507-514 Attrition modeling in the presence of decoys: An operations‐other‐than‐war motivation
by D.P. Gaver & P.A. Jacobs
June 1997, Volume 44, Issue 4
- 301-318 Optimizing submarine berthing with a persistence incentive
by Gerald G. Brown & Kelly J. Cormican & Siriphong Lawphongpanich & Daniel B. Widdis - 319-340 Demand shuffle—A method for multilevel proportional lot sizing and scheduling
by A. Kimms - 341-352 Polynomial algorithms for center location on spheres
by Mordechai Jaeger & Jeff Goldberg - 353-364 On a ruckle problem in discrete games of ambush
by A.Y. Garnaev - 365-381 Heuristic scheduling of resource‐constrained projects with cash flows
by Rema Padman & Dwight E. Smith‐Daniels & Vicki L. Smith‐Daniels - 383-400 A Markovian model for process setup and improvement
by Linguo Gong & James Pruett & Kwei Tang
April 1997, Volume 44, Issue 3
- 229-256 Multiple‐facility loading under capacity‐based economies of scope
by Joseph B. Mazzola & Robert H. Schantz - 257-272 Joint determination of preventive maintenance and safety stocks in an unreliable production environment
by Ki Ling Cheung & Warren H. Hausman - 273-286 A heuristic algorithm for determining replacement policies in k‐out‐of‐n systems
by Chia‐Shin Chung & James Flynn - 287-299 Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
by Awi Federgruen & Gur Mosheiov
March 1997, Volume 44, Issue 2
- 153-164 Analysis of aircraft sortie generation with the use of a fork‐join queueing network model
by Dennis C. Dietz & Richard C. Jenkins - 165-186 Robustness of the normal approximation of lead‐time demand in a distribution setting
by John E. Tyworth & Liam O'Neill - 187-197 A dynamic model for component testing
by I. Kuban Altinel & Süleyman Özekici - 199-209 Warranty policies and burn‐in
by Jie Mi - 211-220 A generalized Johnson's rule for stochastic assembly systems
by Rhonda Righter - 221-228 Note: Dynamic lot sizing for a finite rate input process
by Roger M. Hill
February 1997, Volume 44, Issue 1
- 1-19 Computational study of the multiechelon production planning problem
by Sunil Chopra & M.R. Rao & Chih‐Yang Tsai - 21-46 Cost‐based due‐date assignment with the use of classical and neural‐network approaches
by Patrick R. Philipoom & Lars Wiegmann & Loren Paul Rees - 47-67 Towards finding global representations of the efficient set in multiple objective mathematical programming
by Harold P. Benson & Serpil Sayin - 69-79 Compromise allocation in multivariate stratified sampling: An integer solution
by M. G. M. Khan & M. J. Ahsan & Nujhat Jahan - 81-95 Replacing continuous demand with discrete demand in a competitive location model
by Tammy Drezner & Zvi Drezner - 97-108 Minimization of expected variance of completion times on single machine for stochastic jobs
by V. Rajendra Prasad & D. K. Manna - 109-125 Decomposition and hybrid simulated annealing heuristics for the parallel‐machine total tardiness problem
by Christos Koulamas - 127-146 Exact bayesian estimation of system reliability from component test data
by Jen Tang & Kwei Tang & Herbert Moskowitz - 147-152 Note: Optimal allocation of resources to nodes of series systems with respect to failure‐rate ordering
by Harshinder Singh & Radhey S. Singh
December 1996, Volume 43, Issue 8
- 1035-1047 Lot sizing when yields increase during the production run
by Karla E. Bourland & Candace Arai Yano - 1049-1077 Optimal accelerated life test designs for Burr type XII distributions under periodic inspection and type I censoring
by Nesar Ahmad & A. Islam - 1079-1108 Reliability models and inference for systems operating in different environments
by Myles Hollander & Edsel A. Peña - 1109-1125 A class of Bayes‐optimal two‐stage screens
by R. J. Boys & K. D. Glazebrook & D. J. Laws - 1127-1146 Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties
by X. Cai & F. S. Tu - 1147-1161 On the orbit characteristics of the M/G/ 1 retrial queue
by J. R. Artalejo & G. I. Falin
October 1996, Volume 43, Issue 7
- 937-953 General solution to many‐on‐many heterogeneous stochastic combat
by Shahrooz Parkhideh & A. V. Gafarian - 955-970 Modified fictitious play
by Saul I. Gass & Pablo M. R. Zafra & Ziming Qiu - 971-984 Sequencing with setup time and order tardiness trade‐offs
by Ching‐Jong Liao & Cheng‐Hsing Chuang - 985-1008 Algorithms for the constrained maximum‐weight connected graph problem
by Heungsoon Felix Lee & Daniel R. Dooly - 1009-1024 Availability analysis of a two‐unit series system with a priority shut‐off rule
by Ding‐Hua Shi & Liming Liu - 1025-1034 Exploiting symmetry in the reliability analysis of coherent systems
by M. Xie & C. D. Lai
September 1996, Volume 43, Issue 6
- 765-795 Deterministic algorithms for constrained concave minimization: A unified critical survey
by Harold P. Benson - 797-820 An exact solution approach for the time‐dependent traveling‐salesman problem
by Russ J. Vander Wiel & Nikolaos V. Sahinidis - 821-837 Finding saddle points on polyhedra: Solving certain continuous minimax problems
by George E. Monahan - 839-861 Estimating negative binomial demand for retail inventory management with unobservable lost sales
by Narendra Agrawal & Stephen A. Smith - 863-884 Optimal design of accelerated life tests with two stresses
by Jung‐Won Park & Bong‐Jin Yum - 885-895 Modeling the fatigue life of longitudinal elements
by Barry C. Arnold & Enrique Castillo & José María Sarabia - 897-916 Parallel machine scheduling: A probabilistic analysis
by Nanda Piersma & H. Edwin Romeijn - 917-927 Note: Normal prediction under linear‐quadratic loss
by Michael Cain - 929-936 Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
by Suna Köksalan Kondakci & Meral Azizoglu & Murat Köksalan
August 1996, Volume 43, Issue 5
- 603-612 Multi‐period airline overbooking with multiple fare classes
by Richard E. Chatwin - 613-627 Ordinal ranking methods for multicriterion decision making
by Zachary F. Lansdowne - 629-654 The customer order lead‐time problem on parallel machines
by James D. Blocher & Dilip Chhajed - 655-671 An algorithm for optimal shipments with given frequencies
by M. G. Speranza & W. Ukovich - 673-689 Solving the generalized knapsack problem with variable coefficients
by Kaj Holmberg & Kurt Jörnsten - 691-708 Ordering policies for an inventory system with three supply modes
by Victoria L. Zhang - 709-719 Single‐machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
by Suresh Chand & Rodney Traub & Reha Uzsoy - 721-735 A total tardiness problem with preprocessing included
by Christos Koulamas - 737-748 On locally optimal independent sets and vertex covers
by Gang Yu & Olivier Goldschmidt - 749-763 The maximum collection problem with time‐dependent rewards
by E. Erkut & J. Zhang
June 1996, Volume 43, Issue 4
- 463-480 Using multiple searchers in constrained‐path, moving‐target search problems
by Robert F. Dell & James N. Eagle & Gustavo Henrique Alves Martins & Almir Garnier Santos - 481-489 A fast infiltration game on n arcs
by V. J. Baston & A. Y. Garnaev - 491-502 Analysis of a two‐component series system with a geometric process model
by Yeh Lam & Yuan Lin Zhang - 503-518 Convex envelope results and strong formulations for a class of mixed‐integer programs
by Meltem Denizel & S. Selcuk Erenguc & Hanif D. Sherali - 519-531 An extreme‐point approach for obtaining weighted ratings in qualitative multicriteria decision making
by Wade D. Cook & Moshe Kress - 533-548 Customer waiting‐time distributions under base‐stock policies in single‐facility multi‐item production systems
by Awi Federgruen & Ziv Katalan - 549-561 Cost allocation in continuous‐review inventory models
by Bruce C. Hartman & Moshe Dror - 563-572 On the (S‐1, S) inventory model under compound poisson demands and i.i.d. unit resupply times
by Ki Ling Cheung - 573-587 The single‐machine absolute‐deviation early‐tardy problem with random completion times
by Umar M. Al‐Turki & John Mittenthal & M. Raghavachari - 589-602 Availability of an operating system during a given time interval: A dynamic programming approach
by Wolfgang Stadje
April 1996, Volume 43, Issue 3
- 319-333 Optimal number of minimal repairs before replacement of a system subject to shocks
by Shey‐Huei Sheu & William S. Griffith - 335-348 Measuring newness
by Myron M. Melenevsky - 349-364 An evaluation of scheduling heuristics for dynamic single‐processor scheduling with early/tardy costs
by David J. Robb & Thomas R. Rohleder - 365-380 Limiting behavior of mixtures of discrete lifetime distributions
by Jie Mi - 381-396 Evaluation of base‐stock policies in multiechelon inventory systems with state‐dependent demands. Part II: State‐dependent depot policies
by Jing‐Sheng Song & Paul H. Zipkin - 397-413 Generalized linear programming and sensitivity analysis techniques
by Emmanuel Macalalag & Moshe Sniedovich - 415-434 The vehicle‐routing problem with delivery and back‐haul options
by Shoshana Anily - 435-461 An exact algorithm for the maximal covering problem
by Brian T. Downs & Jeffrey D. Camm
March 1996, Volume 43, Issue 2
- 159-168 Optimal control of continuous‐time terminal‐value birth‐and‐death processes and airline overbooking
by Richard E. Chatwin - 169-189 Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
by Awi Federgruen & Michal Tzur - 191-210 Inventory models of future supply uncertainty with single and multiple suppliers
by Mahmut Parlar & David Perry - 211-231 Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure
by Selcuk Karabati & Panagiotis Kouvelis - 233-249 The equivalence of general set‐covering and implicit integer programming formulations for shift scheduling
by Stephen E. Bechtold & Larry W. Jacobs - 251-264 Compound poisson approximation in systems reliability
by A. D. Barbour & Ourania Chryssaphinou & Malgorzata Roos - 265-288 Scheduling jobs that are subject to failure propagation
by Sid Browne & Kevin D. Glazebrook - 289-303 On the value of information in dynamic production/inventory problems under forecast evolution
by Refik Güllü - 305-312 A compound measure of dependability for systems modeled by continuous‐time absorbing Markov processes
by Attila Csenki - 313-318 Note: “Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems”
by Michael X. Weng & Jose A. Ventura
February 1996, Volume 43, Issue 1
- 1-21 Ripples, complements, and substitutes in generalized networks
by Antoine Gautier & Frieda Granot - 23-40 Adaptive search for solving hard project scheduling problems
by Rainer Kolisch & Andreas Drexl - 41-58 A simple approximation for a multistage capacitated production‐inventory system
by Paul Glasserman & Sridhar Tayur - 59-77 Combination setwise‐Bonferroni‐type bounds
by Timothy M. Costigan - 79-101 The individual station technique for the analysis of cyclic polling systems
by Mandyam M. Srinivasan & Hanoch Levy & Alan G. Konheim - 103-118 Multilinear extensions and quotients of simple games
by R. Amer & F. Carreras & A. Magaña & G. Owen - 119-128 Minimizing quality control costs for laboratory instruments using information delays
by Lance A. Matheson & Joanna R. Baker - 129-142 A lost sales (S — 1, S) perishable inventory system with renewal demand
by S. Kalpakam & K. P. Sapna - 143-149 Scheduling workers in a constricted area
by J. Brimberg & W. J. Hurley & R. E. Wright - 151-157 Recursive evaluation of order‐up‐to‐S policies for two‐echelon inventory systems with compound Poisson demand
by Sven Axsäter & Wen‐Fa Zhang
December 1995, Volume 42, Issue 8
- 1141-1160 Facility location and capacity acquisition: An integrated approach
by Vedat Verter & M. Cemal Dincer - 1161-1176 Consistency of several variants of the standardized time series area variance estimator
by Halim Damerdji & David Goldsman - 1177-1189 A search game on the union of graphs with immobile hider
by Ljiljana Pavlović - 1191-1201 Weak order stability under risk
by Thomas Kämpke - 1203-1232 Use of a classifier in a knowledge‐based simulation optimization system
by Ingrid W. M. Crouch & Allen G. Greenwood & Loren Paul Rees - 1233-1250 Distributions of manufacturer's and user's replacement costs under warranty
by Izzet Sahin & Hakan Polatoglu - 1251-1262 A note on minimizing the expected makespan in flowshops subject to breakdowns
by Charles Du & Michael Pinedo - 1263-1270 Minimizing the weighted sum of quadratic completion times on a single machine
by Federico Della Croce & Wlodzimierz Szwarc & Roberto Tadei & Paolo Baracco & Raffaele di Tullio
October 1995, Volume 42, Issue 7
- 1007-1020 Multiperiod resource allocation with a smoothing objective
by Hanan Luss & Moshe B. Rosenwein - 1021-1039 Optimal cutoff strategies in capacity expansion problems
by Michael Monticino & James Weisinger - 1041-1062 Gittins‐index heuristics for research planning
by K. D. Glazebrook & R. W. Owen - 1063-1079 A replacement model with overhauls and repairs
by Xiao‐Gao Liu & Viliam Makis & Andrew K. S. Jardine - 1081-1097 An economic two‐stage screening procedure with a prescribed outgoing quality in logistic and normal models
by Do Sun Bai & Hyuck Moo Kwon & Min Koo Lee - 1099-1108 The evolution of a selection system
by R. R. Read - 1109-1114 Optimal timing schedules in earliness‐tardiness single machine sequencing
by Wlodzimierz Szwarc & Samar K. Mukhopadhyay - 1115-1128 An exact aggregation/disaggregation algorithm for large scale markov chains
by David S. Kim & Robert L. Smith - 1129-1140 Note: A local‐search heuristic for large set‐covering problems
by Larry W. Jacobs & Michael J. Brusco
September 1995, Volume 42, Issue 6
- 873-887 Optimal force mix in heterogeneous combat
by N. K. Jaiswal & Meena Kumari & B. S. Nagabhushana - 889-913 Single‐stage, multi‐product production/inventory systems with lost sales
by Tayfur Altiok & Goang An Shiue - 915-934 The single period procurement problem where dedicated supplier capacity can be reserved
by Karuna Jain & Edward A. Silver - 935-948 Makespan minimization for m parallel identical processors
by Johnny C. Ho & Johnny S. Wong - 949-966 Scheduling to minimize release‐time resource consumption and tardiness penalties
by Chung‐Lun Li & Edward C. Sewell & T. C. E. Cheng - 967-992 Restricted planar location problems and applications
by H. W. Hamacher & S. Nickel - 993-1005 A suboptimality bound for permutation policies in single machine stochastic scheduling
by K. D. Glazebrook
August 1995, Volume 42, Issue 5
- 737-755 Scheduling target illuminators in naval battle‐group anti‐air warfare
by Hanif D. Sherali & Youngho Lee & Donald D. Boyer - 757-771 Some comments on the optimal assembly problem
by Frank K. Hwang & Uriel G. Rothblum - 773-790 Strategic investment to reduce setup times in the economic lot scheduling problem
by Guillermo Gallego & Ilkyeong Moon - 791-806 A primal‐dual algorithm for the dynamic lotsizing problem with joint set‐up costs
by Ömer Kirca - 807-819 Approximate evaluation of batch‐ordering policies for a one‐warehouse, N non‐identical retailer system under compound poisson demand
by Sven Axsäter - 821-837 Short‐term retrenchment planning in hierarchical manpower systems
by Jayaram K. Sankaran - 839-859 An (s, q) inventory model with stochastic and interrelated lead times
by Ruud Heuts & Jan de Klein - 861-872 Assemble to order and assemble in advance in a single‐period stochastic environment
by Amit Eynan & Meir J. Rosenblatt
June 1995, Volume 42, Issue 4
- 535-547 Simple probability models for assessing the value of information in defense against missile attack
by Rui Almeida & Donald P. Gaver & Patricia A. Jacobs - 549-557 Quick‐response assessment of forward air control and communications using a queueing model and digital simulation
by Douglas A. Samuelson & Robert L. Sims - 559-577 Lanchester models of the ardennes campaign
by Jerome Bracken - 579-584 Lanchester modeling and the biblical account of the battles of gibeah
by Israel David - 585-607 A mathematical model of attrition data
by Dean S. Hartley - 609-633 Validating Lanchester's square law and other attrition models
by Dean S. Hartley & Robert L. Helmbold - 635-669 Rates of advance in land combat operations
by Robert L. Helmbold - 671-690 Use of the amphibious warfare model to evaluate the cost effectiveness of alternative marine corps amphibious assault vehicles
by George Akst - 691-713 The combat simulation of desert storm with applications for contingency operations
by Jeffrey A. Appleget - 715-736 Analysis of air operations during DESERT SHIELD and DESERT STORM
by Frederic T. Case & Christopher W. Hines & Steven N. Satchwell
April 1995, Volume 42, Issue 3
- 311-343 A proposed foundation for a theory of combat
by C. J. Ancker - 345-373 Attrition formulas for deterministic models of large‐scale combat
by Lowell Bruce Anderson - 375-395 On weapons scores and force strengths
by Lowell Bruce Anderson & Frederic A. Miercort - 397-418 Efficient concentration of forces, or how to fight outnumbered and win
by David L. Bitters - 419-433 Termination decision rules in combat attrition models
by N. K. Jaiswal & B. S. Nagabhushana - 435-490 “The influence of the numerical strength of engaged forces in their casualties,” by M. Osipov
by Robert L. Helmbold & Allan S. Rehm - 491-501 A modified lanchester linear process calibrated to historical data
by John Richard Scales - 503-533 A fast approximation of homogeneous stochastic combat
by J. Yang & A. V. Gafarian
March 1995, Volume 42, Issue 2
- 147-150 Introduction to the special issue on air‐land‐naval warfare models
by Jerome Bracken & Moshe Kress & Richard E. Rosenthal - 151-181 An introduction to variable‐resolution modeling
by Paul K. Davis - 183-208 Cutting some trees to see the forest: On aggregation and disaggregation in combat models
by Richard J. Hillestad & Mario L. Juncosa - 209-232 Experiments in variable resolution combat modeling
by Richard Hillestad & John Owen & Don Blumenthal - 233-246 A stochastic version of the concepts evaluation model (CEM)
by Ralph E. Johnson & Ernst K. Isensee & William T. Allison - 247-265 A synthesis of methods for simulating vulnerability of armored vehicles
by Fǎnicǎ Gavril - 267-289 A salvo model of warships in missile combat used to evaluate their staying power
by Wayne P. Hughes - 291-309 The analysis of ship air defense: The simulation model SEAROADS
by Martin P. F. M. van Dongen & Joost Kos
February 1995, Volume 42, Issue 1
- 1-13 Scheduling peacetime rotation of Pakistan army units
by Robert F. Dell & Richard E. Rosenthal & Shafqat Baig - 15-26 Search for an infiltrator
by Ljiljana Pavlovic - 27-38 Criteria and approximate methods for path‐constrained moving‐target search problems
by Lyn C. Thomas & James N. Eagle - 39-56 Service levels in distribution systems with random customer order size
by E. P. Chew & L. A. Johnson - 57-80 Expressions for item fill rates in periodic inventory systems
by M. Eric Johnson & Hau L. Lee & Tom Davis & Robert Hall - 81-102 Weighted vertex packing problem for specially structured geometric graphs
by Gang Yu & Panagiotis Kouvelis & Songjun Luo - 103-121 Dual criteria preemptive open‐shop problems with minimum makespan
by George Vairaktarakis & Sartaj Sahni - 123-140 The advantage of deeper pockets in Silverman's game on intervals
by Gerald A. Heuer & Ulrike Leopold‐Wildburger - 141-145 Note: Open‐shop scheduling with release dates to minimize maximum lateness
by Hans Kellerer & Thomas Tautenhahn & Gerhard Woeginger