Setting parameters for scheduling targets under emergent situations

Abstract

The parameter setting problems are to modify the initial parameters of a system optimally such that some pre-specific objective of the system can be reached. The principle behind parameter setting could be regarded as a target-first philosophy. The parameter setting problems can be found applications in the many real production systems, particularly in the emergency situation. In this paper, we consider the parameter setting problems for some classical single machine scheduling problems. We present O(n ²) algorithms for the processing-time setting problem of 1||∑C _i , the processing-time setting problem of 1||T _max, the processingtime setting problem of 1|r _i |C _max, and the release time setting problem of 1|ri|C _max with fixed lower bounds and fixed unit cost, respectively. We also show that the due-time setting problem of 1||T _max is NP-hard.

Keywords:

• parameter setting
• scheduling target
• emergent situation