Improved bounds for batch scheduling with nonidentical job sizes

Publisher： John Wiley & Sons Inc

E-ISSN： 1520-6750|61|5|351-358

ISSN： 0894-069X

Source： Naval Research Logistics: An International Journal, Vol.61, Iss.5, 2014-08, pp. : 351-358

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

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time

By Chen Bo   Deng Xiaotie   Zang Wenan  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 85-95

Springer Publishing Company

Access to resources Recommend Favorite

Batch-Processing Scheduling with Setup Times

By Dang Chuangyin   Kang Liying  

Journal of Combinatorial Optimization, Vol. 8, Iss. 2, 2004-06 ,pp. : 137-146

Springer Publishing Company

Access to resources Recommend Favorite

Single batch machine scheduling with deliveries

By  

Naval Research Logistics: An International Journal, Vol. 894-069X, Iss. 6, 2015-09 ,pp. : 470-482

John Wiley & Sons Inc

Access to resources Recommend Favorite

Single batch machine scheduling with deliveries

By  

Naval Research Logistics: An International Journal, Vol. 62, Iss. 6, 2015-09 ,pp. : 470-482

John Wiley & Sons Inc

Access to resources Recommend Favorite

Tight Performance Bounds of CP-Scheduling on Out-Trees

By Vakhania N.  

Journal of Combinatorial Optimization, Vol. 5, Iss. 4, 2001-12 ,pp. : 445-464

Springer Publishing Company

Access to resources Recommend Favorite