Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1263
Title: Group sequencing around a common due date
Authors: Cheng, TCE 
Kovalyov, MY
Ng, CTD 
Lam, SS
Keywords: Single machine scheduling
Group technology
Earliness–tardiness
Dynamic programming
Issue Date: Aug-2008
Publisher: Elsevier B.V.
Source: Discrete optimization, Aug. 2008, v. 5, no. 3, p. 594-604 How to cite?
Journal: Discrete optimization 
Abstract: The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence independent setup time precedes the processing of each group. All jobs have a common fixed due date, which can be either unrestrictively large or restrictively small. The objective is to minimize the total weighted earliness–tardiness. Properties of optimal solutions are established, and dynamic programming algorithms are derived to solve several special cases of this problem. Computational experiments show that the algorithms can easily solve problems with 500 groups of jobs and each group has 10 to 50 jobs on a standard PC.
URI: http://hdl.handle.net/10397/1263
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.04.003
Rights: Discrete Optimization © 2008 Published by Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Cheng_Kov_Ng_Lam_DO_Final.pdfPre-published version209.11 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of May 25, 2016

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of May 19, 2016

Page view(s)

354
Last Week
4
Last month
Checked on May 22, 2016

Download(s)

551
Checked on May 22, 2016

Google ScholarTM

Check

Altmetric



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