Name
Title | ||
|---|---|---|
Makespan minimization scheduling with ready times, group technology and shortening job processing times. |
Abstract | ||
|---|---|---|
We investigate a group scheduling problem with shortening job processing times on a single machine in which the shortening is proportional-linear shortening and the setup time of a group is fixed. For the maximum completion time (i.e. the makespan) minimization problem with ready times, we show that the general case of the problem can be solved in polynomial time if the number of groups is a given... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1093/comjnl/bxy007 | The Computer Journal |
Keywords | Field | DocType |
scheduling,group technology,shortening job processing times,ready time | Job shop scheduling,Industrial engineering,Scheduling (computing),Computer science,Minification,Group technology,Distributed computing | Journal |
Volume | Issue | ISSN |
61 | 9 | 0010-4620 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jibo Wang | 1 | 745 | 41.50 |
| Lu Liu | 2 | 0 | 0.34 |
| Jian-Jun Wang | 3 | 3 | 1.72 |
| Lin Li | 4 | 3 | 3.21 |