Name
Abstract | ||
|---|---|---|
In this paper, a three-machine permutation flow shop scheduling problem with time-dependent processing times is considered. By the time-dependent processing times we mean that the job's processing time is an increasing function of its starting time. The objective is to find a sequence that minimizes the makespan. This problem is well known to be NP-hard. Several dominance properties and a lower bound are derived to speed up the elimination process of a branch-and-bound algorithm. Moreover, two heuristic algorithms are proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational experiments on randomly generated problems are conducted to evaluate the branch-and-bound algorithm and heuristic algorithm. Computational results show that the proposed heuristic algorithm M-NEH perform effectively and efficiently. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.cor.2012.08.006 | Computers & OR |
Keywords | DocType | Volume |
computational result,processing time,three-machine flow shop,branch-and-bound algorithm,elimination process,Minimizing makespan,heuristic algorithm,computational experiment,increasing function,dominance property,scheduling problem,time-dependent processing time | Journal | 40 |
Issue | ISSN | Citations |
2 | 0305-0548 | 17 |
PageRank | References | Authors |
0.89 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jibo Wang | 1 | 745 | 41.50 |
| Mingzheng Wang | 2 | 251 | 15.78 |