Considering the game-theoretic approach and ultra combinative costs on scheduling

International Journal of Advanced Manufacturing Technology

Volumn 70, Issue 5-8, 2014, Pages 1473-1485

  Arasteh, Abdollah ^a   Naini, Seyyed Gholamreza Jalali ^a   Aliahmadi, Alireza ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Cooperative games; Game theory; Matroid optimization; Scheduling; Ultra combinative costs

Indexed keywords

COOPERATIVE GAME; COOPERATIVE GAME THEORY; ESTIMATION ALGORITHM; FACILITY LOCATIONS; GAME-THEORETIC; NEGATIVE EXTERNALITIES; NETWORK DESIGN; STRONGLY NP-HARD;

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COSTS; OPTIMIZATION; SCHEDULING;

GAME THEORY;

EID: 84896709266     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-013-5388-9     Document Type: Article

References (67)

1. Ahmad I, Ranka S, Khan SU (2008) Using game theory for scheduling tasks on multi-core processors for simultaneous optimization of performance and energy. In IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008). 2008: Miami, FL
2. Zhou G, Jiang P, Huang GQ (2010) A game-theory approach for job scheduling in networked manufacturing. Int J Adv Manuf Technol 41(9-10):972-985
3. Li WD et al. (2008) Game theory-based cooperation of process planning and scheduling. In 12th International Conference on Computer Supported Cooperative Work in Design, 2008. CSCWD 2008. Xi'an. p. 841-845
4. Bilbao JM, Martínez-Legaz JE (2012) A convex representation of totally balanced games. J Math Anal Appl 387(2):1167-1175. doi: 10.1016/j.jmaa.2011.10.026
5. Nemhauser GL, Wolsey MA, Fisher ML (1978) An analysis of algorithm for maximizing for submodular set functions-I. Math Program 14:265-294
6. Gilliens DB (1959) Solutions to general non-zero-sum games in contributions to the theory of games. Princeton University Press, Princeton
7. Ganesan S et al (2009) Supply chain management and retailer performance: emerging trends. Issues and Implications for Research and Practice Journal of Retailing 85(1):84-94. doi: 10.1016/j.jretai.2008.12.001
8. Shapley LS, Shubik M (1966) Quasi-cores in a monetary economy with nonconvex preferences. Econometrica 34:805-827
9. Maschler M, Peleg B, Shapley LS (1979) Geometric properties of the kernel, nucleolus and related solutions concepts. Mathematics of operations research 4:303-338
10. Shapley LS, Shubik M (1971) The assignment game I: the core. International Journal of Game Theory 1:111-130
11. Owen G (1975) On the core of linear production games. Math Program 9(5):358-370
12. Granot D, Hoberman G (1981) Minimum cost spanning tree games. Math Program 21:1-18
13. Potters J, Curiel I, Tijs S (1991) Traveling salesman games. Math Program 53:199-211
14. Mishra D, Rangarajan B (2005) Cost sharing in a job scheduling problem using the Shapley value. In 6th ACM Conference on Electronic Commerce
15. Maniquet F (2003) A characterization of the Shaley value in queuing problems. J Econ Theory 109:90-103
16. Curiel I, Pederzoli G, Tijs S (1989) Sequencing games. Eur J Oper Res 40:344-351
17. Geomans MX, Skutella M (2004) Cooperative facility location games. Journal of Algorithms 50:194-214
18. Hartman B, Dror M, Shaked M (2000) Cores of inventory centralization games. Games and Economic Behavior 31:26-49
19. Gerchak Y, Gupta D (1991) On apportioning costs to customers in centralized continuous review inventory systems. J Oper Manag 10:546-551
20. Chen J et al (2007) Polynomial time approximation schemes and parameterized complexity. Discret Appl Math 155(2):180-193. doi: 10.1016/j.dam.2006.04.040
21. van den Heuvel W, Borm P, Hamers H (2005) Economic lot-sizing games. Eur J Oper Res 176:1117-1130
22. Peleg B, Sudholter P (2007) Introduction to the theory of cooperative games, 2nd edn. Springer, Berlin
23. Peleg B, Rosenmuller J (1992) The least core, nucleolus, and kernel of homogeneous weighted majority games. Games and Economic Behavior 4:588-605
24. Einy E, Monderer D, Moreno D (1998) The least core, kernel and bargaining sets of large games. Economic Theory 11:585-601
25. Lehrer E (2002) Allocations processes in cooperative games. International Journal of Game Theory 31:341-351
26. Reijnierse H et al (1996) Simple flow games. Games and Economic Behavior 16:238-260
27. Faigle U, Kern W, Paulusma D (2000) Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical Methods of Operations Research 52:23-38
28. Kern W, Paulusma D (2003) Matching games: the least core and the nucleolus. Mathematics of operations research 28:294-308
29. Faigle U, Kern W, Paulusma D (2001) On the computation of the nucleolus of the cooperative game. International Journal of Game Theory 30:79-98
30. Schulz AS, Uhan NA (2007) Encouraging cooperation in sharing supermodular costs. In: Charikar M, Jansen K, Reingold O, JDP Rolim (eds.) Approximation, randomization, and combinatorial optimization: algorithms and techniques. Springer, Berlin (APPROX-RANDOM 2007)
31. Dell'Amico M, Maffioli F, Malucelli F (2003) The base-matroid and inverse combinatorial optimization problems. Discret Appl Math 128(2-3):337-353
32. Wolsey LA (1985) Mixed integer programming formulations for production planning and scheduling problems. In 12th International Symposium on Mathematical Programming. 1985, MIT: Cambridge, MA
33. Queyranne M (1993) Structure of a simple scheduling polyhedron. Math Program 58:263-285
34. Queyranne M, Schulz AS (1995) Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds. In Integer Programming And Combinatorial Optimization (IPCO 1995). Springer, Berlin
35. Goemans MX et al (2002) Single machine scheduling with release dates. SIAM J Discret Math 15:165-192
36. Topkis D (1979) Equilibrium points in non-zero sum n-person submodular games. SIAM J of Control and Optimization 17(6):773-787
37. Vives X (1990) Nash equilibrium with strategic complementarities. J Math Econ 19:305-321
38. Milgrom P, Roberts J (1990) Rationalizability and learning in games with strategic complementarities. Econometrica 58:1255-1278
39. Bulow JI, Geanakoplos JD, Klemperer PD (1985) Multimarket oligopoly: strategic substitutes and strategic complements. J Polit Econ 93:488-511
40. Cooper R, John A (1988) Coordinating coordination failures in Keynesian models. Q J Econ 103(3):441-463
41. Topkis DM (1988) Supermodularity and complementarity. Princeton University Press, Princeton
42. Kasperski A, Zieliński P (2007) Discrete optimization on combinatorial optimization problems on matroids with uncertain weights. Eur J Oper Res 177(2):851-864
43. Lifshits MA, Zani M (2008) Approximation complexity of additive random fields. J Complex 24(3):362-379
44. Liu L et al (2007) Complexity and approximation of the minimum recombinant haplotype configuration problem theoretical computer science 378(3):316-330. doi: 10.1016/j.tcs.2007.02.036
45. Ng CT et al (2010) "Product partition" and related problems of scheduling and systems reliability: computational complexity and approximation. Eur J Oper Res 207(2):601-604
46. Grotschel M, Lovasz L, Shrijver A (1988) Geometric algorithms and combinatorial optimization. Annals of discrete mathematics. Springer, Berlin
47. Kacem I, Chu C, Souissi A (2008) Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Computers & Operations Research 35(3):827-844. doi: 10.1016/j.cor.2006.04. 010
48. Ambuhl C, Mastrollli M (2006) Single machine precedence constrained scheduling is a vertex cover problem. In 14th Annual European Symposium on Algorithms (ESA 2006). Springer, Berlin
49. Smith WE (1956) Various optimizers for single-stage production. Naval Research Logistics Quarterly 3:59-66
50. Wu C-C, Lee W-C (2009) Single-machine and flowshop scheduling with a general learning effect model. Computers & Industrial Engineering 56(4):1553-1558. doi: 10.1016/j.cie.2008.10.002
51. Oron D (2008) Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times. Computers & Operations Research 35(6):2071-2078
52. Tavakkoli-Moghaddam R et al (2005) Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert. Appl Math Comput 167(2):1430-1450. doi: 10.1016/j.amc.2004.08.022
53. Geomans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42:1115-1145
54. Lazarev AA, Werner F (2009) Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem. Math Comput Model 49(9-10):2061-2072
55. Zhang L, Wirth A (2009) On-line scheduling of two parallel machines with a single server. Computers & Operations Research 36(5):1529-1553. doi: 10.1016/j.cor.2008.02.015
56. Abdekhodaee AH, Wirth A (2002) Scheduling parallel machines with a single server: some solvable cases and heuristics. Computers & Operations Research 29(3):2995-315. doi: 10.1016/S0305-0548(00)00074-5
57. Huang S, Cai L, Zhang X (2010) Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server. Computers & Industrial Engineering 58(1):165-174. doi: 10.1016/j.cie.2009.10.003
58. Gabow H, Tarjan R (1984) Efficient algorithms for a family of matroid intersection problems. Journal of Algorithms 5:80-131
59. Wang X, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur J Oper Res 178(1):57-70
60. Wang G, Cheng TCE (2003) Customer order scheduling to minimize total weighted completion time. In First Multidisciplinary Conference on Scheduling Theory and Applications
61. Leung JY-T, Li H, Pinedo ML (2005) Order scheduling in an environment with dedicated resources in parallel. J Sched 8:355-386
62. Chen Z-L and Hall NG (2001) Supply chain scheduling: assembly systems. Department of Systems Engineering, University of Pennsylvania
63. Faigle U, Kern W (1993) On some approximately balanced combinatorial cooperative games. Methods and Models of Operations Research 38:141-152
64. Faigle U, Kern W (1998) Approximate core allocation for binpacking games. SIAM J Discret Math 11:388-399
65. Immorlika N, Mahdian M, Mirrokni V (2005) Limitations of cross-monotonic cost sharing schemes. In 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005)
66. Pal, M, Tardos E (2003) Group strategy proof mechanisms via primal-dual algorithms. In 44th Annual IEEE symposium on Foundations of Computer Science (FOCS 2003)
67. Ambuhl C et al (2007) Scheduling with precedence constraints of low fractional dimension. In 12th Conference on Integer Programming and Combinatorial Optimization (IPCO 2007). Springer, Berlin