Scheduling chains to minimize mean flow time

Information Processing Letters

Volumn 61, Issue 6, 1997, Pages 297-301

  Dror, Moshe ^a,d   Kubiak, Wieslaw ^b   Dell'Olmo, Paolo ^c  

^a UNIVERSITY OF ARIZONA   (United States)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^c Istituto di Analisi dei Sistemi ed   (Italy)

^d Laboratoire EM2C   (France)

Author keywords

Analysis of algorithms; Combinatorial problems; Computational complexity

Indexed keywords

EID: 0008480083     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00037-9     Document Type: Article

References (7)

1. J. Blazewicz, K. Ecker, G. Schmidt and J. Weglarz, Scheduling in Computer and Manufacturing Systems (Springer, Berlin, 1993).
2. J.L. Bruno, E.G. Coffman Jr and R. Sethi, Scheduling independent tasks to reduce mean finishing time, Comm. ACM 17 (1974) 382-387.
3. P. Dell'Olmo, M. Drorand W. Kubiak, 'Strong'-'Weak' chain constrained scheduling, Working Paper, MIS Department, College of Business and Public Administration, University of Arizona, Tucson, AZ, 1993.
4. J. Du, J.Y.-T. Leung and G.H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow time, Inform. Comput. 92 (1991) 219-236.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
6. W. Kubiak, New results on the completion time variance minimization, Discrete Appl. Math. 58 (1995) 157-168.
7. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, eds., Logistics of Production and Inventory (North-Holland, Amsterdam, 1993) 445-522.