Revision as of 14:53, 27 November 2023 edit Citation bot (talk \| contribs) Bots 5,872,421 edits Removed proxy/dead URL that duplicated identifier. \| Use this bot. Report bugs. \| Suggested by Corvus florensis \| #UCB_webform 195/2500 ← Previous edit		Revision as of 22:08, 27 November 2023 edit undo 128.46.76.204 (talk) →Linear programming formulation: The constraints on the total costs of assigning jobs to a given machine should be bounded by T; thus, the summation index should be j, as it should range over the set of jobs. Next edit →
Line 41: * <math>\sum_{i=1}^m z_{i,j} = 1</math> for every job ''j'' in 1,...,''n;'' * <math>\sum_{ij=1}^mn z_{i,j}\cdot p_{i,j} \leq T</math> for every machine ''i'' in 1,...,''m;'' * <math>z_{i,j} \in \{0,1\}</math> for every ''i'', ''j''.

Unrelated-machines scheduling: Difference between revisions