Answers are grounded in this paper and cite their sources.
Scheduling problems can be formulated as mathematical programs with integrity requirement on some variables. In this paper some properties of linearly solvable mixed integer programing are discussed, and experiments are reported where integer solutions have been obtained by linear programming.
No takes yet. Share an insight, caveat, or question.
Gerhard Mensch (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: