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.