Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Lawrence M. Wein
Information about the author Lawrence M. Wein will soon be added to the site.
Found
31 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Revenue management of a make-to-stock queue
2006
Motivated by recent electronic marketplaces, we consider a single-product...
A smart market for industrial procurement with capacity constraints
2005
We address the problem of designing multi-item procurement auctions for a...
An inverse-optimization-based auction mechanism to support a multiattribute request for quotation process
2003
We consider a manufacturer who uses a reverse, or procurement, auction to determine...
Optimization of influenza vaccine selection
2005
The World Health Organization (WHO) recommends which strains of influenza to include...
Analyzing bioterror response logistics: the case of anthrax
2005
To aid in understanding how best to respond to a bioterror anthrax attack, we analyze...
A simple and effective component procurement policy for stochastic assembly systems
2001
We examine the component procurement problem in a single-item, make-to-stock assembly...
Analysis of a decentralized production–inventory system
2003
While research on decentralized supply chains has been an active area of late, this...
Analysis of a forecasting–production–inventory system with stationary demand
2001
We consider a production stage that produces a single item in a make-to-stock manner....
Inventory management of remanufacturable products
2000
We address the procurement of new components for recyclable products in the context of...
Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem
2001
This paper examines how setups, due dates, and the mix of standardized and customized...
Dynamic allocation of kidneys to candidates on the transplant waiting list
2000
The crux of the kidney allocation problem is the trade-off between clinical efficiency...
Management of antiretroviral therapy for HIV infection: Analyzing when to change therapy
2000
We analyze two joint decisions in the management of HIV-infected patients on...
The stochastic economic lot scheduling problem: Heavy traffic analysis of dynamic cyclic policies
2000
We consider two queueing control problems that are stochastic versions of the economic...
Heavy traffic analysis of the dynamic stochastic inventory-routing problem
1999
We analyze three queueing control problems that model a dynamic stochastic...
Heavy traffic analysis of polling systems in tandem
1999
We analyze the performance of a tandem queueing network populated by two customer...
A dynamic stochastic stock-cutting problem
1998
We consider a stock cutting problem for a paper plant that produces sheets of various...
Dynamic scheduling of a two-class queue with setups
1998
We analyze two scheduling problems for a queueing system with a single server and two...
Inspection for circuit board assembly
1997
Several stages of tests are typically performed in circuit board assembly, and each...
Setting base stock levels using product-form queueing networks
1996
A manufacturing facility produces multiple products in a make-to-stock manner, and...
Dynamic scheduling of a production/inventory system with by-products and random yield
1995
Motivated by semiconductor wafer fabrication, the authors consider a scheduling...
Optimal control of a two-station tandem production/inventory system
1994
A manufacturing facility consisting of two stations in tandem operates in a...
Scheduling networks of queues: Heavy traffic analysis of a multistation closed network
1993
The authors consider the problem of finding an optimal dynamic priority sequencing...
A product design problem in semiconductor manufacturing
1992
The authors consider the product design problem of allocating the chip sites on a...
Brownian networks with discretionary routing
1991
Motivated by scheduling problems that arise in flexible manufacturing systems, the...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers