Name
Abstract | ||
|---|---|---|
•Investigate flow shop scheduling problem with capacitated batch-processing machines.•Propose an integer programming model and a branch and bound algorithm to solve it to optimality.•Several optimality properties are proved; based on these optimality properties, a heuristic algorithm with worst-case analysis is designed to obtain near-optimal solutions.•Thorough computational experiments are performed to compare the performance of the model and the algorithms. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2019.04.016 | Computers & Operations Research |
Keywords | Field | DocType |
Flow shop,Batch scheduling,NP-hard,Dynamic programming,Heuristics,Worst-case analysis,Branch and bound algorithm | Mathematical optimization,Branch and bound,Job shop scheduling,Heuristic (computer science),Integer linear programming model,Scheduling (computing),Time limit,Mathematics,Rolling mill,Computational complexity theory | Journal |
Volume | ISSN | Citations |
108 | 0305-0548 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feng Li | 1 | 9 | 2.51 |
| Yanyan Zhang | 2 | 149 | 23.51 |
| Han Wei | 3 | 0 | 0.34 |
| Xiaofan Lai | 4 | 0 | 0.34 |