Inverse scheduling with controllable job parameters Online publication date: Sat, 19-Feb-2005
by Christos Koulamas
International Journal of Services and Operations Management (IJSOM), Vol. 1, No. 1, 2005
Abstract: Scheduling problems deal with how to sequence a list of jobs with the objective of minimising some measurement of the job completion times. Inverse scheduling problems assume that a job sequence is given and the objective is to determine the minimal perturbation to the job parameters (e.g., processing times) so that the given sequence becomes optimal with respect to a pre-selected objective function. The objective of this paper is to study inverse scheduling problems. It will be shown that these problems can be formulated as linear programming (LP) problems even when, in some cases, the corresponding forward scheduling problems are not solvable in polynomial time. Several applications are discussed, including the generation of benchmark optimal solutions for NP-hard forward scheduling problems.
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 Services and Operations Management (IJSOM):
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