Cyclic just-in-time sequences are optimal

DOI10.1023/A:1024847308982MaRDI QIDQ1407256zbMATH OpenOpenAlexFDO

Authors Wieslaw Kubiak

Publication date 15 September 2003

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1024847308982

zbMATH Keywords

apportionment problemassignment problemconvex functionsjust-in-time systemsOptimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Note on cyclic sequences in the product rate variation problem
• Optimality of the cyclic sequence on bottleneck product rate variation problem with a general objective
• A simple approach to the product rate variation problem via axiomatics
• Just-in-time sequencing algorithms for mixed-model production systems
• Cyclic lot-sizing problems with sequencing costs

Cited in

(9)

• Sequencing mixed-model assembly lines: survey, classification and model critique
• The maximum deviation just-in-time scheduling problem.
• A note on bottleneck product rate variation problem with square-deviation objective
• Optimality of the cyclic sequence on bottleneck product rate variation problem with a general objective
• Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches
• Level scheduling under limited resequencing flexibility
• Using aggregation to reduce response time variability in cyclic fair sequences
• Throughput-optimal sequences for cyclically operated plants
• Sequencing mixed-model assembly lines to minimize part inventory cost

This page was built for publication: Cyclic just-in-time sequences are optimal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407256)