Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29580
Title: Single machine batch scheduling with resource dependent setup and processing times
Authors: Cheng, TCE 
Janiak, A
Kovalyov, MY
Keywords: Batching
Linear programming
Polynomial algorithm
Resource allocation
Scheduling
Issue Date: 2001
Publisher: Elsevier
Source: European journal of operational research, 2001, v. 135, no. 1, p. 177-183 How to cite?
Journal: European journal of operational research 
Abstract: Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished. Processing of a batch requires a machine setup time common for all batches. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource, which may be different from that for the jobs. Polynomial time algorithms are presented to find an optimal batch sequence and resource values such that either the total weighted resource consumption is minimized, subject to meeting job deadlines, or the maximum job lateness is minimized, subject to an upper bound on the total weighted resource consumption. The algorithms are based on linear programming formulations of the corresponding problems.
URI: http://hdl.handle.net/10397/29580
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/S0377-2217(00)00312-X
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

41
Last Week
0
Last month
0
Citations as of Aug 13, 2017

WEB OF SCIENCETM
Citations

28
Last Week
0
Last month
1
Citations as of Aug 12, 2017

Page view(s)

43
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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