Sequencing interval situations and related games

Uncertainty accompanies almost every situation in real world and it influences our decisions. In sequencing situations it may affect parameters used to determine an optimal order in the queue, and consequently the decision of whether (or not) to rearrange the queue by sharing the realized cost savings. This paper extends the analysis of one-machine sequencing situations and their related cooperative games to a setting with interval data, i.e. when the agents’ costs per unit of time and/or processing time in the system lie in intervals of real numbers obtained by forecasting their values. The question addressed here is: How to determine an optimal order (if the initial order in the queue is not so) and which approach should be used to motivate the agents to adopt the optimal order? This question is an important one that deserves attention both in theory and practice