Simultaneous minimization of total completion time and total deviation of job completion times

European Journal of Operational Research

Volumn 157, Issue 2, 2004, Pages 296-306

  Mosheiov, Gur ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Deterministic; Dynamic programming; Multiple criteria; Pseudo polynomial algorithm; Scheduling; Single machine

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

DETERMINISTICS; MULTIPLE CRITERIA; PSEUDO-POLYNOMIAL ALGORITHM; SINGLE MACHINE;

OPERATIONS RESEARCH;

EID: 2042540024     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00193-0     Document Type: Article

References (16)

1. Bagchi U. Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems. Operations Research. 37:1989;118-125.
2. Bagchi U., Sullivan R., Cheng Y. Minimizing mean absolute deviation of completion times about a common due-date. Naval Research Logistics Quarterly. 33:1986;227-240.
3. Baker K.R., Scudder G.D. Sequencing with earliness and tardiness penalties: A review. Operations Research. 38:1990;22-36.
4. Chen C.-J., Bulfin R.L. Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research. 70:1993;115-125.
5. De P., Ghosh J.B., Wells C.W. On the minimization of completion time variance with a bicriteria extension. Operations Research. 40:1992;1148-1155.
6. Federgruen A., Mosheiov G. Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems. Naval Research Logistics. 40:1993;951-970.
7. Hall N.G. Single- and multi-processor models for minimizing completion time variance. Naval Research Logistics Quarterly. 33:1986;49-54.
8. Hall N.G., Kubiak W., Sethi S.P. Earliness-tardiness scheduling problems II: Deviation of completion times about a restrictive common due-date. Operations Research. 39:1991;847-856.
9. Hall N.G., Posner M.E. Earliness-tardiness scheduling problems I: Weighted deviation of completion times about a common due-date. Operations Research. 39:1991;836-846.
10. Hardy G.H., Littlewood J.E., Polya G. Inequalities. 1967;Cambridge University Press, London.
11. Herrmann J.W., Lee C.-Y. On scheduling to minimize earliness-tardiness and batch delivery costs with a common due-date. European Journal of Operational Research. 70:1993;272-288.
12. Kanet J.J. Minimizing the average deviation of job completion times about a common due-date. Naval Research Logistics Quarterly. 28:1981;643-651.
13. Kubiak W., Lou S., Sethi S. Equivalence of mean flow time problems and mean absolute deviation problems. Operations Research Letters. 9:1990;371-374.
14. Lee C.-Y., Danusapturo S.L., Lin C.S. Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due-date. Computers and Operations Research. 18:1991;379-389.
15. Mosheiov, G., 2000. Simultaneous Minimization of Total Completion Time and Total Deviation of Job Completion Times. Working Paper, School of Business Administration, The Hebrew University, Jerusalem.
16. Sundararaghavan P., Ahmed M. Minimizing the sum of absolute lateness in single-machine and multi-machine scheduling. Naval Research Logistics Quarterly. 31:1984;325-333.