Solution of the generalized Townsend single machine scheduling model

European Journal of Operational Research

Volumn 91, Issue 1, 1996, Pages 203-210

  Szwarc, Wlodzimierz ^a   Mukhopadhyay, Samar K ^a  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

Author keywords

Branch and bound method; Job completion time; Schedule

Indexed keywords

EID: 0042056287     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00125-5     Document Type: Article

References (5)

1. Delia Croce, F., Szwarc, W., Tadei, R., Baracco, P., and Di Tullio, R. (1995), "Minimizing the weighted sum of quadratic completion times on a single machine", Naval Research Logistics 42, 1263-1270.
2. Sen, T., Dileepan, P., and Ruparel, B. (1990), "Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach", Engineering Costs and Production Economics 18, 197-202.
3. Szwarc, W. (1990), "Parametric precedence relations in single machine scheduling", Operations Research Letters 9, 133-140.
4. Szwarc, W., Posner, M.E., and Liu, J.J. (1988), "The single machine problem with a quadratic cost function of completion times", Management Science 34, 1480-1488.
5. Townsend, W. (1978), "The single-machine problem with quadratic penalty function of completion times: A branch-and-bound solution", Management Science 24, 530-534.