On the convexity of games corresponding to sequencing situations with due dates
نویسندگان
چکیده
This paper considers sequencing situations with due date criteria. Three di erent types of criteria are considered: the weighted penalty criterion, the weighted tardiness criterion and the completion time criterion. The main focus is on convexity of the associated cooperative games.
منابع مشابه
On the Convexity of Precedence Sequencing Games
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.
متن کاملOn the Extreme Points of the Core of Neighbour Games and Assignment Games
Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, neighbour games are as well assignment games as line graph restricted games. We will show that the intersection of the class of assignment games and the class of line graph restricted games yields the class of neighbour games. Further, w...
متن کاملA review on symmetric games: theory, comparison and applications
Game theory models decision makers' behaviors in strategic situations. Since the structures of games are different, behavior and preferences of the players are different in various types of game. This paper reviews various situations of games. Here, characteristics of some common games are discussed and compared. Specifically, we focus on a group of games called symmetric games including Prison...
متن کاملConvexity in Stochastic Cooperative Situations
This paper introduces a new model concerning cooperative situations in which the payoffs are modeled by random variables. First, we study adequate preference relations of the agents. Next, we define corresponding cooperative games and we introduce and study various basic notions like an allocation, the core and marginal vectors. Furthermore, we introduce three types of convexity, namely coaliti...
متن کاملAn approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 136 شماره
صفحات -
تاریخ انتشار 2002