On the convexity of games corresponding to sequencing situations with due dates

European Journal of Operational Research

Volumn 136, Issue 3, 2002, Pages 616-634

  Borm, Peter ^a   Fiestras Janeiro, Gloria ^b   Hamers, Herbert ^a   Sánchez, Estela ^b   Voorneveld, Mark ^a  

^a TILBURG UNIVERSITY   (Netherlands)

^b UNIVERSITY OF VIGO   (Spain)

Author keywords

Convexity; Cooperative games; Due date criteria; Sequencing situations

Indexed keywords

COST EFFECTIVENESS; GAME THEORY; JOB ANALYSIS; OPERATIONS RESEARCH;

COOPERATIVE GAMES;

SEQUENTIAL MACHINES;

EID: 0036466562     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00070-4     Document Type: Article

References (16)

1. Sequencing games
2. Cooperation in one machine scheduling
3. On games corresponding to sequencing situations with ready times
4. Super-modularity: Applications to convex games and the greedy algorithm for LP
5. Sequencing to minimize the weighted number of tardy jobs
6. Values of graph-restricted games
7. Machine scheduling problems
8. A value for n-person games
9. Cores of convex games
10. Convex games without side payments
11. Various optimizers for single-stage production
12. Stochastic cooperative games: Superadditivity, convexity and certainty equivalents