The weighted common due date single machine scheduling problem revisited

Computers and Operations Research

Volumn 23, Issue 3, 1996, Pages 255-262

  Szwarc, Wlodzimierz ^a  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; JOB ANALYSIS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; POLYNOMIALS; SCHEDULING;

COMPLETION TIME; EARLINESS TARDINESS COMMON DUE DATE; JOB SCHEDULING; PSEUDOPOLYNOMIAL ALGORITHM;

JUST IN TIME PRODUCTION;

EID: 0030108272     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)O0025-O     Document Type: Article

References (7)

1. K. R. Baker and G. D. Scudder, Sequencing with earliness and tardiness penalties: a review. Opns Res. 38, 22-36 (1990).
2. N. G. Hall and M. E. Posner, Earliness tardiness scheduling problems, I: weighted deviation of completion times about a restricted common due date, Opns Res. 38, 836-846 (1991).
3. N. G. Hall, W. Kubiak and S. P. Sehti, Earliness tardiness scheduling problems, II: deviation of completion times about a restrictive common due date. Opns Res. 39, 847-856 (1991).
4. J. A. Hoogeveen and S. L. van de Velde, Scheduling around a small common due date. Eur. J. Opnl Res. 52, (1991).
5. C. Y. Lee, S. L. Danusaputro and C. S. Lin, Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date. Computers Opns Res. 18, 379-389 (1991).
6. W. Szwarc, M. E. Posner and J. J. Liu, The single machine problem with a quadratic cost function of completion times. Mgmt Sci. 34, 1480-1488 (1988).
7. W. Szwarc, Parametric precedence relations in single machine scheduling. Opns Res. Lett. 9, 133-140 (1990).