A lagrangian approach to single-machine scheduling problems with two competing agents

Journal of Scheduling

Volumn 12, Issue 4, 2009, Pages 401-415

  Agnetis, Alessandro ^a   De Pascale, Gianluca ^a   Pacciarelli, Dario ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b ROMA TRE UNIVERSITY   (Italy)

Author keywords

Branch and bound; Lagrangian relaxation; Multi agent scheduling; Single machine scheduling

Indexed keywords

BRANCH-AND-BOUND; BRANCH-AND-BOUND ALGORITHMS; COMPLETION TIME; LAGRANGIAN APPROACHES; LAGRANGIAN DUAL; LAGRANGIAN RELAXATION; MAXIMUM LATENESS; MULTI-AGENT SCHEDULING; OBJECTIVE FUNCTIONS; POLYNOMIAL-TIME; SCHEDULING PROBLEM; SINGLE-MACHINE SCHEDULING; TOTAL WEIGHTED COMPLETION TIME;

ALGORITHMS; MACHINERY; MULTI AGENT SYSTEMS; POLYNOMIAL APPROXIMATION;

LAGRANGE MULTIPLIERS;

EID: 68249108426     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0098-0     Document Type: Article

References (15)

1. V. Albino N. Carbonara I. Giannoccaro 2006 Innovation in industrial districts: an agent-based simulation model International Journal of Production Economics 104 30 45 (Pubitemid 44223993)
2. C. Arbib M. Servilio S. Smriglio 2004 A competitive scheduling problem and its relevance to UMTS channel assignment Networks 44 2 132 141 (Pubitemid 39198114)
3. A. Agnetis P. B. Mirchandani D. Pacciarelli A. Pacifici 2000 Nondominated schedules for a job-shop with two competing agents Computational and Mathematical Organization Theory 6 2 191 217
4. A. Agnetis P. B. Mirchandani D. Pacciarelli A. Pacifici 2004 Scheduling problems with two competing agents Operations Research 52 2 229 242 (Pubitemid 40000802)
5. K. R. Baker J. Cole Smith 2003 A multiple-criterion model for machine scheduling Journal of Scheduling 6 1 7 16
6. T. C. E. Cheng C. T. Ng J. J. Yuan 2006 Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs Theoretical Computer Science 362 273 281 (Pubitemid 44374206)
7. T. C. E. Cheng C. T. Ng J. J. Yuan 2008 Multi-agent scheduling on a single machine with max-form criteria European Journal of Operational Research 188 603 609
8. C. T. Ng T. C. E. Cheng J. J. Yuan 2006 A note on the complexity of the problem of two-agent scheduling on a single machine Journal of Combinatorial Optimization 12 4 387 394
9. Y. Pan 2003 An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time Operations Research Letters 31 492 496
10. J. M. Peha 1995 Heterogeneous-criteria scheduling: minimizing weighted number of tardy jobs and weighted completion time Journal of Computers and Operations Research 22 10 1089 1100
11. M. E. Posner 1985 Minimizing weighted completion times with deadlines Operations Research 33 3 562 574
12. W. E. Smith 1956 Various optimizers for single-stage production Naval Research Logistics Quarterly 3 1 59 66
13. Sourd, F. (2008). Private communication.
14. Blażewicz, J., Ecker, K., Pesch, E., Schmidt, G., & Wȩglarz, J. (2001). Scheduling computer and manufacturing processes (2nd ed.). Berlin: Springer
15. Leung, J. Y.-T. (Ed.) (2004). Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: Chapman & Hall