Abstract
Optimisation problems are concerned with finding optimal solutionswith respect to some objective functions with given problem parameters.Inverse optimisation refers to the situation where the problem parameters areminimally adjusted so that a given feasible solution becomes an optimalsolution with respect to the objective function. In this paper we study inverseoptimisation of single-machine scheduling problems to minimise the totalweighted completion time, whereby the processing times and the weights areminimally adjusted, respectively, so that a given feasible schedule becomes anoptimal schedule, under the constraint that the objective value based on theadjusted parameters is no worse than that based on the original parameters.Three distance measures, namely L1-norm, L2-norm, and L8-norm, areconsidered for each of the problems under study. Such scheduling problems areknown as inverse scheduling, which has wide applications including berthallocation in quayside in shipping operations.
| Original language | English |
|---|---|
| Pages (from-to) | 312-322 |
| Number of pages | 11 |
| Journal | International Journal of Shipping and Transport Logistics |
| Volume | 3 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jun 2011 |
Keywords
- Inverse optimisation
- Scheduling
- Single-machine
ASJC Scopus subject areas
- Business and International Management
- Management of Technology and Innovation
- Management Science and Operations Research
- Transportation