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 |
Issue Date: | Aug-2008 | Source: | Discrete optimization, Aug. 2008, v. 5, no. 3, p. 594-604 | 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. | Keywords: | Single machine scheduling Group technology Earliness–tardiness Dynamic programming |
Publisher: | Elsevier B.V. | Journal: | Discrete optimization | 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 | Size | Format | |
---|---|---|---|---|
Cheng_Kov_Ng_Lam_DO_Final.pdf | Pre-published version | 209.11 kB | Adobe PDF | View/Open |
Page views
142
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
158
Citations as of Oct 13, 2024
SCOPUSTM
Citations
9
Last Week
1
1
Last month
0
0
Citations as of Oct 17, 2024
WEB OF SCIENCETM
Citations
8
Last Week
0
0
Last month
0
0
Citations as of Oct 17, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.