SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

An effective algorithm for the capacitated single item lot size problem · Study

ArticleShelves

ArticleAn effective algorithm for the capacitated single item lot size problem

Chia‐Shin Chung1994

Article1994

An effective algorithm for the capacitated single item lot size problem

Chia‐Shin Chung · James Flynn · Chien-Hua Mike Lin

25 citations·0/0 files stored·European Journal of Operational Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Supply Chain and Inventory Management Scheduling and Optimization Algorithms Optimization and Mathematical Programming

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 25 citations exist upstream.

References

1958Dynamic Version of the Economic Lot Size Model 2004Dynamic Version of the Economic Lot Size Model 1969A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach 1991A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time 1973Bounded Production and Inventory Models with Piecewise Concave Costs 1975Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results 1978An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints 1969Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model

Cited by

2010Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(NlogN) time 2010Stochastic lot-sizing problem with inventory-bounds and constant order-capacities

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

1979Coordinated replenishments of items under time‐varying demand: Dynamic programming formulationarticle · 10 shared references 1993Decision horizons for the capacitated lot size model with inventory bounds and stockoutsarticle · 10 shared references 2012A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventoryarticle · 10 shared references 2007Polynomial Algorithms for Single-Item Lot-Sizing Models With Bounded Inventory and Backlogging or Outsourcingarticle · 10 shared references 1994A dynamic programming algorithm for dynamic lot size models with piecewise linear costsarticle · 10 shared references 1990A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraintsarticle · 9 shared references

Details

Year1994

Typearticle

Published1994-06-01

VenueEuropean Journal of Operational Research

ISSN-L0377-2217

Languageen

Citations25

Files0 public / 0

ShelfSupply Chain and Inventory Management

Identifiers

doi10.1016/0377-2217(94)90086-8

openalex_workW1995168503

Links

Imported from OpenAlex (CC0) — nothing here is generated.