ON GAMES CORRESPONDING TO SEQUENCING SITUATIONS WITH READY TIMES

Authors
HAMERS H BORM P TIJS S
Citation
H. Hamers et al., ON GAMES CORRESPONDING TO SEQUENCING SITUATIONS WITH READY TIMES, Mathematical programming, 69(3), 1995, pp. 471-483
Citations number
10
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics,"Computer Science Software Graphycs Programming
Journal title
Mathematical programming → ACNP
ISSN journal
00255610
Volume
69
Issue
3
Year of publication
1995
Pages
471 - 483
Database
ISI
SICI code
0025-5610(1995)69:3<471:OGCTSS>2.0.ZU;2-3
Abstract
This paper considers the special class of cooperative sequencing games that arise from one-machine sequencing situations in which all jobs h ave equal processing times and the ready time of each job is a multipl e of the processing time. By establishing relations between optimal or ders of subcoalitions, it is shown that each sequencing game within th is class is convex.