A PTAS for the p-batch scheduling with pj = p to minimize total weighted completion time

Jinjiang Yuan; Weiping Shang

doi:10.3934/jimo.2005.1.353

Article Contents

2005, Volume 1, Issue 3: 353-358. Doi: 10.3934/jimo.2005.1.353

This issue Previous Article Optimal preemptive online scheduling to minimize lp norm on two processors Next Article Theoretical analysis and a search procedure for the joint replenishment problem with deteriorating products

A PTAS for the p-batch scheduling with pj = p to minimize total weighted completion time

Jinjiang Yuan^1, and
Weiping Shang^1,

1.
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China

Received: August 31, 2004

Revised: January 31, 2005

Published: June 2005

Abstract Related Papers Cited by

Abstract

We consider the single machine parallel-batching scheduling problem with precedence relations, release dates and identical processing times to minimize total weighted completion time. We give a polynomial-time approximation scheme (PTAS) for the problem.

Keywords:

Mathematics Subject Classification: 90B35, 90C27.

Citation:

Article Metrics

HTML views() PDF downloads(118) Cited by(0)

A PTAS for the p-batch scheduling with pj = p to minimize total weighted completion time

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

A PTAS for the p-batch scheduling with pj = p to minimize total weighted completion time

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content