Name
Abstract | ||
|---|---|---|
•We propose a method to measure the robustness of a cyclic hoist schedule.•A bi-objective mixed integer linear programming (MILP) model is proposed.•The model aims to minimize the cycle time and maximize the robustness.•Pareto solutions are obtained by solving single-objective MILP models using CPLEX.•The optimal cycle time is a piecewise linear increasing function of the robustness. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejor.2014.06.047 | European Journal of Operational Research |
Keywords | Field | DocType |
Cyclic scheduling,Hoist scheduling,Robust scheduling,Mixed integer linear programming | Mathematical optimization,Job shop scheduling,Ideal point,Robust optimization,Hoist (device),Robustness (computer science),Multi-objective optimization,Integer programming,Software,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
240 | 3 | 0377-2217 |
Citations | PageRank | References |
13 | 0.61 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ada Che | 1 | 292 | 21.39 |
| Jianguang Feng | 2 | 30 | 3.02 |
| Haoxun Chen | 3 | 773 | 60.23 |
| Chengbin Chu | 4 | 1486 | 126.84 |