A continuous-time average-cost flexible manufacturing and operator scheduling model solved by deconvexification over time

DOI10.1016/0024-3795(89)90473-4zbMath0672.90067OpenAlexW2013556299MaRDI QIDQ1120468

B. Curtis Eaves, Uriel G. Rothblum

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90473-4

zbMATH Keywords

dynamic programbuffer inventoriescontinuous-time flexible manufacturingdeconvexificationsdeterministic, infinite-horizon, continuous-time discretedeterministic, infinite-horizon, continuous-time discrete dynamic programoperator schedulingsequence of linear programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39)

Related Items (1)

A Discounted-Cost Continuous-Time Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time

Cites Work

• Minimum Convex Cost Dynamic Network Flows
• A Discrete Time Average Cost Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time
• Unnamed Item

This page was built for publication: A continuous-time average-cost flexible manufacturing and operator scheduling model solved by deconvexification over time