Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Eyeballing heuristics for dynamic lot size problems

From MaRDI portal
Publication:1118517
Jump to:navigation, search

DOI10.1016/0305-0548(89)90020-8zbMath0668.90020OpenAlexW2026679453MaRDI QIDQ1118517

Gin Hor Chan, Eng Ung Choo

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90020-8


zbMATH Keywords

heuristic algorithmfinite planning horizondiscrete dynamic lot size problem without backlogging


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)


Related Items

A simple heuristic for multi-product dynamic lot sizing problems ⋮ Eyeballing heuristics for dynamic lot sizing problems with rolling horizons ⋮ Eyeballing heuristics for dynamic lot size problems ⋮ Two-way eyeballing heuristics in dynamic lot sizing with backlogging ⋮ Comparative study of dynamic lot sizing heuristics with backlogging



Cites Work

  • Eyeballing heuristics for dynamic lot size problems
  • Worst case performance for lot sizing heuristics
  • Dynamic Version of the Economic Lot Size Model
  • Two Modifications Of The Silver-Meal Lot Sizing Heuristic
  • Note—Performance Bounds for Lot Sizing Heuristics
  • A Deterministic Multi-Period Production Scheduling Model with Backlogging
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1118517&oldid=13161097"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki