article · Management Science · 1973

Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

Cited by 49Abstract and details only

Abstract

The n job, one-machine scheduling problem is considered where set-up and processing times are random and the objective is to minimize the number of late jobs. In the deterministic case, Moore's algorithm is known to produce an optimal schedule. A chance-constrained formulation of the nondeterministic problem is derived in which a job is processed if the probability that it will be completed prior to its due date is greater than a specified level. A deterministic equivalent problem is achieved to which application of a modification of Moore's algorithm is proven to produce an optimal schedule.

Cite this paper

APA 7

Balut, S. J. (1973). Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain. Management Science, 19(11), 1283–1288. https://doi.org/10.1287/mnsc.19.11.1283

MLA 9

Balut, Stephen J. “Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain.” Management Science, vol. 19, no. 11, 1973, pp. 1283–88, https://doi.org/10.1287/mnsc.19.11.1283.

Chicago

Balut, Stephen J. 1973. “Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain.” Management Science 19 (11): 1283–88. https://doi.org/10.1287/mnsc.19.11.1283.

Harvard

Balut, S.J. (1973) ‘Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain’, Management Science, 19(11), pp. 1283–1288. Available at: https://doi.org/10.1287/mnsc.19.11.1283.

BibTeX

@article{balut1973scheduling,
  title = {{Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain}},
  author = {Balut, Stephen J.},
  journal = {Management Science},
  volume = {19},
  number = {11},
  pages = {1283--1288},
  year = {1973},
  doi = {10.1287/mnsc.19.11.1283}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.