Skip to main content
Official Logo of Columbia Business School
Academics
  • Visit Academics
  • Degree Programs
  • Admissions
  • Tuition & Financial Aid
  • Campus Life
  • Career Management
Faculty & Research
  • Visit Faculty & Research
  • Academic Divisions
  • Search the Directory
  • Research
  • Faculty Resources
  • Teaching Excellence
Executive Education
  • Visit Executive Education
  • For Organizations
  • For Individuals
  • Program Finder
  • Online Programs
  • Certificates
About Us
  • Visit About Us
  • CBS Directory
  • Events Calendar
  • Leadership
  • Our History
  • The CBS Experience
  • Newsroom
Alumni
  • Visit Alumni
  • Update Your Information
  • Lifetime Network
  • Alumni Benefits
  • Alumni Career Management
  • Women's Circle
  • Alumni Clubs
Insights
  • Visit Insights
  • Digital Future
  • Climate
  • Business & Society
  • Entrepreneurship
  • 21st Century Finance
  • Magazine
CBS Landing Image
Faculty & Research
  • Academic Divisions
  • Search the Faculty
  • Research
  • Faculty Resources
  • News
  • More 

Operations & Supply Chain Management

See the latest research, articles and faculty on the Operations & Supply Chain Management Area of Expertise at Columbia Business School.

Jump to main content

Latest on Operations & Supply Chain Management

No articles have been found by those filters.

Pagination

  • Page 1
  • Current page 2

Operations & Supply Chain Management Faculty

CBS Faculty Research on Operations & Supply Chain Management

Determining production schedules under base-stock policies in single facility multi-item production systems

Authors
Awi Federgruen and Ziv Katalan
Date
January 1, 1998
Format
Journal Article
Journal
Operations Research

In this paper we address periodic base-stock policies for stochastic economic lot scheduling problems. These represent manufacturing settings in which multiple items compete for the availability of a common capacity source, in the presence of setup times and/or costs, incurred when switching between items, and in the presence of uncertainty regarding demand patterns, production, and setup times. Under periodic base-stock policies, items are produced according to a given periodic item-sequence.

Read More about Determining production schedules under base-stock policies in single facility multi-item production systems

Probabilistic analyses and practical algorithms for inventory-routing models

Authors
Lap Mui Ann Chan, Awi Federgruen, and David Simchi-Levi
Date
January 1, 1998
Format
Journal Article
Journal
Operations Research

We consider a distribution system consisting of a single warehouse and many geographically dispersed retailers. Each retailer faces demands for a single item which arise a deterministic, retailer specific rate. The retailers' stock is replenished by a fleet of vehicles of limited capacity, departing and returning to the warehouse and combining deliveries into efficient routes. The cost of any given route consists of a fixed component and a component which is proportional with the total distance driven. Inventory costs are proportional with the stock levels.

Read More about Probabilistic analyses and practical algorithms for inventory-routing models

Capacity expansion and replacement in growing markets with uncertain technological breakthroughs

Authors
Sampath Rajagopalan, Medini Singh, and Thomas Morton
Date
January 1, 1998
Format
Journal Article
Journal
Management Science

The accelerated pace of technological change has led to rapid obsolescence of productive capacity in electronics and other industries. Managers must consider the impact of future technologies while making acquisition and replacement decisions in such environments. We consider a problem where a sequence of technological breakthroughs are anticipated but their magnitude and timing are uncertain. A firm, operating in such an environment, must decide how much capacity of the current technology to acquire to meet future demand growth.

Read More about Capacity expansion and replacement in growing markets with uncertain technological breakthroughs

Leadtime-inventory trade-offs in assemble-to-order systems

Authors
Paul Glasserman and Yashan Wang
Date
January 1, 1998
Format
Journal Article
Journal
Operations Research

This paper studies the trade-off between inventory levels and the delivery leadtime offered to customers in achieving a target level of service. It addresses the question of how much a delivery leadtime can be reduced, per unit increase of inventory, at a fixed fill rate. We show that for a class of assemble-to-order models with stochastic demands and production intervals there is a simple linear trade-off between inventory and delivery leadtime, in a limiting sense, at high fill rates.

Read More about Leadtime-inventory trade-offs in assemble-to-order systems

The Boundaryless Organization Field Guide: Practical Tools for Building the New Organization

Authors
R. Ashkenas, Todd Jick, D. Ulrich, and C. Paul-Chowdhury
Date
January 1, 1998
Format
Book
Publisher
Jossey-Bass

In The Boundaryless Organization, a world-class team of management experts showed how leading companies were becoming more flexible, innovative, and competitive by breaking the barriers that limit the free flow of resources and information. Now, The Boundaryless Organization Field Guide gives executives, managers, and HR professionals the guidance and resources they need to make their own organizations boundaryless. This hands-on kit includes materials based on the acclaimed WorkOut process initiated at General Electric.

Read More about The Boundaryless Organization Field Guide: Practical Tools for Building the New Organization

Capacity Realization in Stochastic Batch-Processing Networks Using Discrete-Review Policies

Authors
Costis Maglaras and S. Kumar
Date
Forthcoming
Format
Working Paper

We present diÆculties with realizing the capacity of queueing networks with batch servers under well known scheduling disciplines. We intro duce a family of scheduling p olicies called discrete-review p olicies, which not only guarantee capacity realization for queueing networks with batch servers, but also contain among them p olicies that allow us to realize desired b ehavior on \ uid" scale, including asymptotically optimal p olicies.

Read More about Capacity Realization in Stochastic Batch-Processing Networks Using Discrete-Review Policies

Corrected diffusion approximations for a multistage production-inventory system

Authors
Paul Glasserman and Tai-Wen Liu
Date
February 1, 1997
Format
Journal Article
Journal
Mathematics of Operations Research

We analyze a multistage inventory system with limited production capacity facing stochastic demands. Each node follows a periodic-review base-stock policy for echelon inventory: in each period, each node attempts to produce enough material to restore cumulative down-stream inventory to a fixed target level. We develop approximations to the key measures of interest (average inventories, average backorders, and service levels) by simultaneously letting the mean demand approach the system's bottleneck capacity and letting the base-stock level for finished goods increase without bound.

Read More about Corrected diffusion approximations for a multistage production-inventory system

Valuation, Optimal Asset Allocation, and Retirement Incentives of Pension Plans

Authors
M. Suresh Sundaresan and Fernando Zapatero
Date
January 1, 1997
Format
Journal Article
Journal
Review of Financial Studies

We provide a framework in which we link the valuation and asset allocation policies of defined benefits plans with the lifetime marginal productivity schedule of the worker and the pension plan formula. In turn, we examine the retirement policies that are implied by the primitives of the model and the value of pension obligations. Our model provides an explicit valuation formula for a stylized defined benefits plan. The optimal asset allocation policies consist of the replicating portfolio of the pension liabilities and the growth optimum portfolio independent of the pension liabilities.

Read More about Valuation, Optimal Asset Allocation, and Retirement Incentives of Pension Plans

Density estimation through convex combinations of densities: Approximation and estimation bounds

Authors
Assaf Zeevi and Ronny Meir
Date
January 1, 1997
Format
Journal Article
Journal
Neural Networks

We consider the problem of estimating a density function from a sequence of independent and identically distributed observations xi taking value in Rd. The estimation procedure constructs a convex mixture of "basis" densities and estimates the parameters using the maximum likelihood method.

Read More about Density estimation through convex combinations of densities: Approximation and estimation bounds

Pagination

  • First page 1
  • Ellipsis …
  • Page 33
  • Page 34
  • Page 35
  • Page 36
  • Current page 37
  • Page 38
  • Page 39
  • Page 40
  • Page 41
  • Ellipsis …
  • Last page 53

External CSS

Homepage Breadcrumb Block

Official Logo of Columbia Business School

Columbia University in the City of New York
665 West 130th Street, New York, NY 10027
Tel. 212-854-1100

Maps and Directions
    • Centers & Programs
    • Current Students
    • Corporate
    • Directory
    • Support Us
    • Recruiters & Partners
    • Faculty & Staff
    • Newsroom
    • Careers
    • Contact Us
    • Accessibility
    • Privacy & Policy Statements
Back to Top Upward arrow
TOP

© Columbia University

  • X
  • Instagram
  • Facebook
  • YouTube
  • LinkedIn
Back to top

Accessibility Tools

English French German Italian Spanish Japanese Russian Chinese (Simplified) Chinese (Traditional) Arabic Bengali