Inverse scheduling with controllable job parameters Article

Koulamas, C. (2005). Inverse scheduling with controllable job parameters . 1(1), 35-43. 10.1504/IJSOM.2005.006316

cited authors

  • Koulamas, C

authors

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. © 2005 Inderscience Enterprises Ltd.

publication date

  • January 1, 2005

Digital Object Identifier (DOI)

start page

  • 35

end page

  • 43

volume

  • 1

issue

  • 1