Name
Title | ||
|---|---|---|
Single-machine bicriterion group scheduling with deteriorating setup times and job processing times. |
Abstract | ||
|---|---|---|
This paper considers a group scheduling problem with two ordered criteria where both setup times and job-processing times are increasing functions of their starting times. It is assumed that the jobs be classified into several groups and the jobs of the same group have to be processed contiguously. We consider two objectives where the primary criterion is the total weighted completion time and the secondary criterion is the maximum cost. A polynomial time algorithm is presented to solve this bicriterion group scheduling problem with deteriorating setup times and job-processing times. This algorithm can also solve single-machine group scheduling problems with deteriorating setup times and job-processing times in several ordered maximum cost and arbitrary precedence. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.amc.2014.05.048 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Single-machine,Group scheduling,Bicriterion scheduling,Deteriorating jobs | Mathematical optimization,Fair-share scheduling,Computer science,Time complexity,Dynamic priority scheduling,Group scheduling | Journal |
Volume | ISSN | Citations |
242 | 0096-3003 | 3 |
PageRank | References | Authors |
0.38 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian-Jun Wang | 1 | 84 | 5.21 |
| Ya-Jing Liu | 2 | 3 | 0.38 |