Referenced Items are not available for this document.
In this paper we consider the problem of scheduling jobs with and without release dates on parallel unbounded batch processing machines to minimize total completion time. We show that the problem with release dates is strongly NP-hard by a reduction from the strongly NP-hard 3-Partition problem and develop a dynamic programming algorithm for the problem without release dates.
Published in:
Computing, Communication, Control, and Management, 2009. CCCM 2009. ISECS International Colloquium on
(Volume:1
)
Date of Conference: 8-9 Aug. 2009
- Page(s):
- 78 - 81
- Print ISBN:
- 978-1-4244-4247-8
- INSPEC Accession Number:
- 10914879
- Conference Location :
- Sanya
- Digital Object Identifier :
- 10.1109/CCCM.2009.5268145
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
