An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences

Author： Simanchev R.   Urazova I.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 0005-1179

Source： Automation and Remote Control, Vol.71, Iss.10, 2010-10, pp. : 2102-2108

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

A Polynomial-Time Dependence Test for Determining Integer-Valued Solutions in Multi-Dimensional Arrays Under Variable Bounds

By Chang Weng-Long   Chu Chih-Ping   Wu Jia-Hwa  

The Journal of Supercomputing, Vol. 31, Iss. 2, 2005-02 ,pp. : 111-135

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

Minimizing total busy time in offline parallel scheduling with application to energy efficiency in cloud computing

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 9, 2015-06 ,pp. : 2470-2488

John Wiley & Sons Inc

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

Model of joint servicing of real-time service traffic and data traffic. II

By Stepanov S.  

Automation and Remote Control, Vol. 72, Iss. 5, 2011-05 ,pp. : 1028-1035

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite