Note—A Note on the Single-Machine Multi-Product Lot Scheduling Problem

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

This note develops a procedure for automatically generating feasible solutions for the single-machine multi-product lot scheduling problem.

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.