The Schedule-Sequencing Problem

Published Online:https://doi.org/10.1287/opre.7.5.621

A tentative solution to the general schedule-sequencing problem is presented in a linear-programming form. Feasible solutions hinge on work recently presented on integer solutions to linear-programming problems. As yet, the computation involved for a practical problem would be quite large.

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.