Cyclic just-in-time sequences are optimal

DOI10.1023/A:1024847308982zbMath1134.90475OpenAlexW2105046377MaRDI QIDQ1407256

Wiesław X. 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

convex functionsOptimizationapportionment problemassignment problemjust-in-time systems

Mathematics Subject Classification ID

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

Related Items (6)

The maximum deviation just-in-time scheduling problem. ⋮ Unnamed Item ⋮ Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches ⋮ Level scheduling under limited resequencing flexibility ⋮ Sequencing mixed-model assembly lines to minimize part inventory cost ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique

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