Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12035
Title: Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
Authors: Liu, LL
Ng, CT 
Cheng, TCE 
Keywords: Batch processing
Makespan
Release dates
Scheduling
Issue Date: 2014
Publisher: Springer
Source: Optimization letters, 2014, v. 8, no. 1, p. 307-318 How to cite?
Journal: Optimization letters 
Abstract: Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times.
URI: http://hdl.handle.net/10397/12035
ISSN: 1862-4472
EISSN: 1862-4480
DOI: 10.1007/s11590-012-0575-4
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of Aug 9, 2018

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
0
Citations as of Aug 14, 2018

Page view(s)

80
Last Week
0
Last month
Citations as of Aug 19, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.