A two-machine flowshop problem with two agents

Computers and Operations Research

Volumn 38, Issue 1, 2011, Pages 98-104

  Lee, Wen Chiung ^a   Chen, Shiuan Kang ^a   Chen, Cheng Wei ^a   Wu, Chin Chia ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Scheduling; Total completion time; Two agent; Two machine flowshop

Indexed keywords

BRANCH AND BOUND METHOD; HEURISTIC ALGORITHMS; JOB SHOP SCHEDULING; MULTI AGENT SYSTEMS; OPTIMAL SYSTEMS; SCHEDULING; SIMULATED ANNEALING;

BRANCH-AND-BOUND ALGORITHMS; NEAR-OPTIMAL SOLUTIONS; OPTIMAL SOLUTIONS; SCHEDULING PROBLEM; SINGLE- MACHINES; TOTAL COMPLETION TIME; TWO AGENTS; TWO-MACHINE FLOWSHOP;

SCHEDULING ALGORITHMS;

EID: 78049441823     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.04.002     Document Type: Conference Paper

References (33)

1. M.L. Pinedo Scheduling theory: algorithms and system 2nd ed 2002 Prentice-Hall New Jersey
2. A. Agnetis, P.B. Mirchandani, D. Pacciarelli, and A. Pacifici Scheduling problems with two competing agents Operations Research 52 2004 229 242
3. I. Curiel, G. Pederzoli, and S. Tijs Sequencing games European Journal of Operational Research 40 1989 344 351
4. H. Hamers, P. Borm, and S. Tijs On games corresponding to sequencing situations with ready times Mathematical Programming 69 1995 471 483
5. Kim K, Paulson BC, Petrie CJ, Lesser VR. Compensatory negotiation for agent-based schedule coordination. CIFE working paper #55, Stanford University, Stanford, CA, 1999.
6. Schultz D, OH SH, Grecas CF, Albani M, Sanchez J, Arbib C, et al. A QoS concept for packet oriented SUMTS services. In: Proceedings of the 1st Mobile Summit, Thessaloniki, Greece, 2002.
7. K.R. Baker, and J.C. Smith A multiple-criterion model for machine scheduling Journal of Scheduling 6 2003 7 16
8. J.J. Yuan, W.P. Shang, and Q. Feng A note on the scheduling with two families of jobs Journal of Scheduling 8 2005 537 542
9. T.C.E. Cheng, C.T. Ng, and J.J. Yuan Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs Theoretical Computer Science 362 2006 273 281
10. C.T. Ng, T.C.E. Cheng, and J.J. Yuan A note on the complexity of the problem of two-agent scheduling on a single machine Journal of Combinatorial Optimization 12 2006 387 394
11. Leung JYT, Pinedo M, Wan GH. Competitive two agents scheduling and its applications. Operations Research, 2009, in press, doi:10.1287/opre.1090.0744.
12. A. Agnetis, D. Pacciarelli, and A. Pacifici Multi-agent single machine scheduling Annals of Operations Research 150 2007 3 15
13. T.C.E. Cheng, C.T. Ng, and J.J. Yuan Multi-agent scheduling on a single machine with max-form criteria European Journal of Operational Research 188 2008 603 609
14. P. Liu, and L. Tang Two-agent scheduling with linear deteriorating jobs on a single machine Lecture Notes in Computer Science 5092 2008 642 650
15. A. Agnetis, G. Pascale, and D. Pacciarelli A Lagrangian approach to single-machine scheduling problems with two competing agents Journal of Scheduling 12 2009 401 415
16. K.B. Lee, B.C. Choi, J.Y.T. Leung, and M.L. Pinedo Approximation algorithms for multi-agent scheduling to minimize total weighted completion time Information Processing Letters 109 2009 913 917
17. A. Agnetis, D. Pacciarelli, and A. Pacifici Combinatorial models for multi-agent scheduling problems, multiprocessor scheduling, theory and applications 2007 I-Tech Education and Publishing Vienna, Austria
18. W.H. Kohler, and K. Steiglitz Exact, approximate, and guaranteed accuracy algorithms for the flow-shop scheduling problem n/2/F/ F Journal of Association for Computing Machinery 22 1975 106 114
19. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and job shop scheduling Mathematical Operations Research 1 2 1976 117 129
20. B.V. Cadambi, and Y.S. Sathe Two-machine flowshop scheduling to minimise mean flow time Opsearch 30 1993 35 41
21. C.H. Pan, and C.C. Wu An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop International Journal of System Science 27 1996 925 930
22. C. Wang, C. Chu, and J.M. Proth Efficient heuristic and optimal approaches for n/2/F/ ∑ Ci scheduling problems International Journal of Production Economics 44 1996 225 237
23. F.D. Croce, V. Narayan, and R. Tadei The two-machine total completion time flow shop problem European Journal of Operational Research 90 1996 227 237
24. J.A. Hoogeveen, and T. Kawaguchi Minimizing total completion time in a two-machine flowshop: analysis of special cases Mathematics of Operations Research 24 1996 887 910
25. F.D. Croce, M. Ghirardi, and R. Tadei An improved branch-and-bound algorithm for the two machine total completion time flow shop problem European Journal of Operational Research 139 2002 293 301
26. W.C. Lee, and C.C. Wu Minimizing total completion time in a two-machine flowshop with a learning effect International Journal of Production Economics 88 2004 85 93
27. C.C. Wu, and W.C. Lee Two-machine flowshop scheduling to minimize mean flow time under linear deterioration International Journal of Production Economics 103 2006 572 584
28. C.S. Sung, and H.A. Kim A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times International Journal of Production Economics 113 2008 1038 1048
29. Y. Huo, H. Li, and H. Zhao Minimizing total completion time in two-machine flow shop with exact delays Computers and Operations Research 36 2009 2018 2030
30. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker Complexity of machine scheduling problems, studies in integer programming Annals of Discrete Mathematics 1 1977 343 362
31. S. Kirkpatrick, C. Gelatt, and M. Vecchi Optimization by simulated annealing Science 220/4598 1983 671 680
32. D. Ben-Arieh, and O. Maimon Annealing method for PCB assembly scheduling on two sequential machines International Journal of Computer Integrated Manufacturing 5 1992 361 367
33. M.L. Fisher A dual algorithm for the one-machine scheduling problem Mathematical Programming 11 1976 229 251