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

Author： Bianco L.   dell’Olmo P.   Giordani S.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

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

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

Abstract

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

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

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time

By Ng C.  

Annals of Operations Research, Vol. 133, Iss. 1-4, 2005-01 ,pp. : 163-174

Springer Publishing Company

Access to resources Recommend Favorite

Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates

By Chand S.   Traub R.   Uzsoy R.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 115-125

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching

By Avrahami Nir   Azar Yossi  

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

Springer Publishing Company

Access to resources Recommend Favorite