Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties

被引:3
作者
Mahadev, NVR
Pekec, A
Roberts, FS
机构
[1] AARHUS UNIV,DEPT COMP SCI,CTR DANISH NATL RES FDN,DK-8000 AARHUS C,DENMARK
[2] RUTGERS STATE UNIV,DEPT MATH,NEW BRUNSWICK,NJ 08903
[3] RUTGERS STATE UNIV,CTR OPERAT RES,NEW BRUNSWICK,NJ 08903
基金
美国国家科学基金会;
关键词
scheduling; meaningfulness; measurement; earliness/tardiness penalties; modeling;
D O I
10.1016/S0895-7177(97)00080-0
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider the effect of changes of scale of measurement on the conclusion that a particular solution to a scheduling problem is optimal. The analysis in this paper was motivated by the problem of finding the optimal transportation schedule when there are penalties for both late and early arrivals, and when different items that need to be transported receive different priorities. We note that in this problem, if attention is paid to how certain parameters are measured, then a change of scale of measurement might lead to the anomalous situation where a schedule is optimal if the parameter is measured in one way, but not if the parameter is measured in a different way that seems equally acceptable. This conclusion about the sensitivity of the conclusion that a given solution to a combinatorial optimization problem is optimal is different from the usual type of conclusion in sensitivity analysis, since it holds even though there is no change in the objective function, the constraints, or other input parameters, but only in scales of measurement. We emphasize the need to consider such changes of scale in analysis of scheduling and other combinatorial optimization problems. We also discuss the mathematical problems that arise in two special cases, where all desired arrival times are the same and the simplest case where they are not, namely the case where there are two distinct arrival times but one of them occurs exactly once. While specialized, these two examples illustrate the types of mathematical problems that arise from considerations of the interplay between scale-types and optimization.
引用
收藏
页码:9 / 22
页数:14
相关论文
共 30 条
[1]   A SURVEY OF ALGORITHMS FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS SCHEDULING PROBLEM [J].
ABDULRAZAQ, TS ;
POTTS, CN ;
VANWASSENHOVE, LN .
DISCRETE APPLIED MATHEMATICS, 1990, 26 (2-3) :235-253
[2]   ON SCIENTIFIC LAWS WITHOUT DIMENSIONAL CONSTANTS [J].
ACZEL, J ;
ROBERTS, FS ;
ROSENBAUM, Z .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1986, 119 (1-2) :389-416
[3]  
AHMED MU, 1990, IIE T, P288
[4]  
BAGCHI U, 1987, NAV RES LOG, V34, P739, DOI 10.1002/1520-6750(198710)34:5<739::AID-NAV3220340513>3.0.CO
[5]  
2-3
[6]   ON THE ASSIGNMENT OF OPTIMAL DUE DATES [J].
BAKER, KR ;
SCUDDER, GD .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1989, 40 (01) :93-95
[7]   SEQUENCING WITH EARLINESS AND TARDINESS PENALTIES - A REVIEW [J].
BAKER, KR ;
SCUDDER, GD .
OPERATIONS RESEARCH, 1990, 38 (01) :22-36
[8]   DETERMINATION OF AN OPTIMAL COMMON DUE DATE AND OPTIMAL SEQUENCE IN A SINGLE-MACHINE JOB SHOP [J].
BECTOR, CR ;
GUPTA, YP ;
GUPTA, MC .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1988, 26 (04) :613-628
[9]   AN ALGORITHM FOR THE CON DUE-DATE DETERMINATION AND SEQUENCING PROBLEM [J].
CHENG, TCE .
COMPUTERS & OPERATIONS RESEARCH, 1987, 14 (06) :537-542
[10]  
EMMONS H, 1987, NAV RES LOG, V34, P803, DOI 10.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO