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

A heuristic algorithm for a production planning problem in an assembly system

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

DOI10.1057/palgrave.jors.2600683zbMath1054.90513OpenAlexW2093142676MaRDI QIDQ3157305

Yeong-Dae Kim, Moon-Won Park

Publication date: 13 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600683


zbMATH Keywords

heuristicsproduction planning


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)


Related Items (4)

Supply chain models for an assembly system with preprocessing of raw materials ⋮ Optimal production plans and shipment schedules in a supply-chain system with multiple suppliers and multiple buyers ⋮ Finite horizon planning with fixed-interval deliveries and no shortage ⋮ A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints




This page was built for publication: A heuristic algorithm for a production planning problem in an assembly system

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3157305&oldid=16260160"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 22:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki