On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies

DOI10.1007/978-3-319-28697-6_42zbMath1342.90058OpenAlexW2472028730MaRDI QIDQ2806947

Julia Viktorovna Kovalenko, Anton Valentinovich Eremeev

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_42

zbMATH Keywords

mixed integer linear programmingmulti-machine technologies

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Scheduling multiprocessor tasks -- An overview
• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
• Hamilton Paths in Grid Graphs

This page was built for publication: On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies