Inverse scheduling with controllable job parameters

Christos Koulamas

International Journal of Services and Operations Management, 2005, vol. 1, issue 1, 35-43

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.

Keywords: single machine scheduling; flow shop scheduling; linear programming; inverse scheduling; forward scheduling. (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.inderscience.com/link.php?id=6316 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:1:y:2005:i:1:p:35-43

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().