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

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

This publication has 0 references indexed in Scilit: