Scheduling a Multi-Product Single Machine System for an Infinite Planning Period

Published Online:https://doi.org/10.1287/mnsc.14.11.713

This paper describes an easy to apply method of solving the “Single Machine Multi-Product Lot Size Scheduling Problem for an Infinite Planning Period.”

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.