Skip to main content

On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal?

Publication ,  Journal Article
Mahadev, NVR; Pekeč, A; Roberts, FS
Published in: Operations Research
January 1, 1998

We consider the problem of finding an optimal schedule for jobs on a single machine when there are penalties for both tardy and early arrivals. We point out that if attention is paid to how these penalties are measured, then a change of scale of measurement might lead to the anomalous situation where a schedule is optimal if these parameters are measured in one way, but not if they are measured in a different way that seems equally acceptable. In particular, we note that if the penalties measure utilities or disutilities, or loss of goodwill or customer satisfaction, then these kinds of anomalies can occur, for instance if we change both unit and zero point in scales measuring these penalties. We investigate situations where problems of these sorts arise for four specific penalty functions under a variety of different assumptions. The results of the paper have implications far beyond the specific scheduling problems we consider, and suggest that considerations of scale of measurement should enter into analysis of conclusions of optimality both in scheduling problems and throughout combinatorial optimization. © 1998 INFORMS.

Duke Scholars

Published In

Operations Research

DOI

ISSN

0030-364X

Publication Date

January 1, 1998

Volume

46

Issue

3 SUPPL. 1

Related Subject Headings

  • Operations Research
  • 1503 Business and Management
  • 0802 Computation Theory and Mathematics
  • 0102 Applied Mathematics
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Mahadev, N. V. R., Pekeč, A., & Roberts, F. S. (1998). On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal? Operations Research, 46(3 SUPPL. 1). https://doi.org/10.1287/opre.46.3.s120
Mahadev, N. V. R., A. Pekeč, and F. S. Roberts. “On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal?Operations Research 46, no. 3 SUPPL. 1 (January 1, 1998). https://doi.org/10.1287/opre.46.3.s120.
Mahadev NVR, Pekeč A, Roberts FS. On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal? Operations Research. 1998 Jan 1;46(3 SUPPL. 1).
Mahadev, N. V. R., et al. “On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal?Operations Research, vol. 46, no. 3 SUPPL. 1, Jan. 1998. Scopus, doi:10.1287/opre.46.3.s120.
Mahadev NVR, Pekeč A, Roberts FS. On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal? Operations Research. 1998 Jan 1;46(3 SUPPL. 1).

Published In

Operations Research

DOI

ISSN

0030-364X

Publication Date

January 1, 1998

Volume

46

Issue

3 SUPPL. 1

Related Subject Headings

  • Operations Research
  • 1503 Business and Management
  • 0802 Computation Theory and Mathematics
  • 0102 Applied Mathematics