Flowshop/no-idle scheduling to minimise the mean flowtime

Publisher： Cambridge University Press

E-ISSN： 1446-8735|47|2|265-275

ISSN： 1446-1811

Source： ANZIAM Journal, Vol.47, Iss.2, 2005-10, pp. : 265-275

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

Optimal Lehmer Mean Bounds for the Neuman-Sándor Mean

By  

Pacific Journal of Applied Mathematics, Vol. , Iss. , 2014-10 ,pp. : 6-11

Nova Science Publishers, Inc.

Access to resources Recommend Favorite

Two Parallel Machines Scheduling

By Lin S-F.   Chen J-Y.  

Systems Analysis Modelling Simulation, Vol. 42, Iss. 10, 2002-01 ,pp. : 1429-1437

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling Without Payments

By Koutsoupias Elias  

Theory of Computing Systems, Vol. 54, Iss. 3, 2014-04 ,pp. : 375-387

Springer Publishing Company

Access to resources Recommend Favorite

Non-clairvoyant Scheduling Games

By Cohen Johanne  

Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. : 3-23

Springer Publishing Company

Access to resources Recommend Favorite

Online Scheduling with Interval Conflicts

By Halldórsson Magnús  

Theory of Computing Systems, Vol. 53, Iss. 2, 2013-08 ,pp. : 300-317

Springer Publishing Company

Access to resources Recommend Favorite