Name
Title | ||
|---|---|---|
Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times |
Abstract | ||
|---|---|---|
In this study, we consider an n-job, m-machine flow shop scheduling problem with decreasing time-dependent job processing times. By the decreasing time-dependent job processing times, we mean that the processing time is a decreasing function of its execution starting time. When some dominant relationships between m-1 machines can be satisfied, we show that the makespan minimization problem can be solved in polynomial time. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.cie.2011.02.003 | Computers & Industrial Engineering |
Keywords | DocType | Volume |
m-1 machine,processing time,dominant relationship,m-machine flow shop scheduling,time-dependent job processing time,makespan minimization problem,polynomial time,flow shop scheduling,satisfiability | Journal | 60 |
Issue | ISSN | Citations |
4 | Computers & Industrial Engineering | 1 |
PageRank | References | Authors |
0.36 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiao-Yuan Wang | 1 | 42 | 3.99 |
| Mingzheng Wang | 2 | 251 | 15.78 |
| Jibo Wang | 3 | 745 | 41.50 |