Inverse scheduling: applications in shipping Online publication date: Sat, 21-Feb-2015
by F. Zhang, C.T. Ng, G. Tang, T.C.E. Cheng, Y.H.V. Lun
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 3, No. 3, 2011
Abstract: Optimisation problems are concerned with finding optimal solutions with respect to some objective functions with given problem parameters. Inverse optimisation refers to the situation where the problem parameters are minimally adjusted so that a given feasible solution becomes an optimal solution with respect to the objective function. In this paper we study inverse optimisation of single-machine scheduling problems to minimise the total weighted completion time, whereby the processing times and the weights are minimally adjusted, respectively, so that a given feasible schedule becomes an optimal schedule, under the constraint that the objective value based on the adjusted parameters is no worse than that based on the original parameters. Three distance measures, namely L1-norm, L2-norm, and L∞-norm, are considered for each of the problems under study. Such scheduling problems are known as inverse scheduling, which has wide applications including berth allocation in quayside in shipping operations.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook