Name
Title | ||
|---|---|---|
On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost. |
Abstract | ||
|---|---|---|
•We study 10 new supply chain scheduling problems in the on-line environment.•We provide the lower bounds of competitive ratio for all the problems.•We propose optimal algorithms for four of the 10 problems.•We propose approximate algorithms for the other problems.•Computational experiments confirm good performance. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejor.2015.02.008 | European Journal of Operational Research |
Keywords | Field | DocType |
Supply chain scheduling,On-line algorithm,Delivery cost,Makespan | Mathematical optimization,Preemption,Job shop scheduling,Computer science,Scheduling (computing),Open-shop scheduling,Minification,Johnson's rule,Operations management,Special case,Competitive analysis | Journal |
Volume | Issue | ISSN |
244 | 3 | 0377-2217 |
Citations | PageRank | References |
9 | 0.49 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Han | 1 | 11 | 2.23 |
| Wenjun Chris Zhang | 2 | 89 | 2.99 |
| Xiwen Lu | 3 | 182 | 21.03 |
| Yingzi Lin | 4 | 449 | 28.88 |