A common due-date assignment problem on parallel identical machines

Computers and Operations Research

Volumn 28, Issue 8, 2001, Pages 719-732

  Mosheiov, Gur ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; HEURISTIC METHODS; OPERATIONS RESEARCH; POLYNOMIALS; RESOURCE ALLOCATION; SCHEDULING;

DUE-DATE ASSIGNMENT PROBLEMS; PARALLEL IDENTICAL MACHINES;

PARALLEL PROCESSING SYSTEMS;

ALGORITHM;

EID: 0035400730     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00127-6     Document Type: Article

References (10)

1. Smith ML, Dudek RA, Blair LE. Characteristics of US flexible manufacturing system - a survey. In: Stecke KE, Suri R, editors. Flexible manufacturing systems. Amsterdam: Elsevier, 1986.
2. Mosheiov G. Scheduling problems with general earliness and tardiness cost - a just-in-time approach. Dissertation, Graduate School of Business, Columbia University, NY, 1991.
3. Cheng T.C.E., Gupta M.C. Survey of scheduling research involving due date determination decisions. European Journal of Operational Research. 38:1989;156-166.
4. Cheng T.C.E., Chen Z.-.L. Parallel-machine scheduling problems with earliness and tardiness penalties. Journal of The Operational Research Society. 45:1994;685-695.
5. Panwalker S.S., Smith M.L., Seidman A. Common due-date assignment to minimize total penalty for the one machine scheduling problem. Operations Research. 30:1982;391-399.
6. Li C.-.L., Cheng T.C.E. The parallel machine min-max weighted absolute lateness scheduling problem. Naval Research Logistics. 41:1994;33-46.
7. Federgruen A, Mosheiov G. Heuristics for multi-machine minmax scheduling problems with general earliness and tardiness costs. Naval Research Logistics 1996;44:287-299.
8. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics. 17:1969;263-269.
9. Frenk J.B.G., Rinnooy Kan A.H.G. The asymptotic optimality of the LPT rule. Mathematics of Operations Research. 12:1987;241-254.
10. Lawler LE, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Graves SC et al., editors. Handbooks in OR and MS, vol. 4. 1993. pp. 445-521.