Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching

ISSN： 0178-4617

Source： Algorithmica, Vol.47, Iss.3, 2007-04, pp. : 253-268

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties

By Liu Zhaohui Cheng T.C. Edwin

Journal of Scheduling, Vol. 7, Iss. 4, 2004-07 ,pp. : 313-327

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing total completion time subject to release dates and sequence-dependentprocessing times

By Bianco L. dell’Olmo P. Giordani S.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 393-415

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing total weighted completion time with an unexpected machine unavailable interval

By Huo Yumei Reznichenko Boris Zhao Hairong

Journal of Scheduling, Vol. 17, Iss. 2, 2014-04 ,pp. : 161-172

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing total weighted completion time with uncertain data: A stability approach

By Sotskov Yu. Egorova N. Werner F.

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2038-2057

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Heuristics for minimizing total completion time and maximum lateness on identical parallel machines with setup times

By Sabouni M. Jolai F. Mansouri A.

Journal of Intelligent Manufacturing, Vol. 21, Iss. 4, 2010-08 ,pp. : 439-449

Springer Publishing Company

Access to resources Recommend Favorite