This paper surveys methods proposed in the literature for determining the optimal solution to “N Job, M Machines” scheduling problems when there are no due dates or priorities and the sole objective is to complete all operations in least time.
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.