Game theoretic approaches to cost allocation in the dynamic total tardiness problem

References

• Nash , J.F. ( 1950 ) The bargaining problem . Econometrica , 18 , 155 – 162 .
   Web of Science ®Google Scholar
• Lederer , P.J. and Li , L. ( 1997 ) Pricing, production, scheduling, and delivery-time competition . Operations Research , 45 , 407 – 120 .
   Web of Science ®Google Scholar
• Holmstrom , B. ( 1979 ) Moral hazard and observability . Bell Journal of Economics , 10 , 74 – 91 .
   Google Scholar
• Mookherjee , D. ( 1984 ) Optimal incentive schemes with many agents . Review of Economic Studies , 51 , 433 – 446 .
   Web of Science ®Google Scholar
• Alchian , A. and Demsetz , H. ( 1972 ) Production, information costs, and economic organization . American Economic Review , 62 , 777 – 795 .
   Web of Science ®Google Scholar
• Maskin , E. and Tirole , J. ( 1992 ) The principal-agent relationship with an informed principal, II common values . Econometrica , 60 , 1 – 42 .
   Web of Science ®Google Scholar
• Beaudry , P. ( 1994 ) Why an informed principal may leave rents to an agent . International Economic Review , 35 , 821 – 832 .
   Web of Science ®Google Scholar
• Conroy , R.M. and Hughes , J.S. ( 1987 ) Delegated information gathering decisions . The Accounting Review , 62 , 50 – 66 .
   Web of Science ®Google Scholar
• Billera , L.J. , Heath , D.C. and Raanan , J. ( 1978 ) Internal telephone billing rates - a novel application of non-atomic game theory . Operations Research , 26 , 956 – 965 .
   Web of Science ®Google Scholar
• Zimmerman , J.L. ( 1979 ) The costs and benefits of cost allocations . The Accounting Review , 54 , 504 – 521 .
   Web of Science ®Google Scholar
• van den Nouweland , A. , Borm , P. , van Golstein Brouwers , W. , Groot Bruinderink , R. and Tijs , S. ( 1996 ) A game theoretic approach to problems in telecommunication . Management Science , 42 , 294 – 303 .
   Web of Science ®Google Scholar
• Robinson , L.W. ( 1993 ) A comment on Gerchak and Gupta's “On apportioning costs to customers in centralized continuous review inventory systems ”. Journal of Operations Management , 11 , 99 – 102 .
   Google Scholar
• Hartman , B.C. and Dror , M. ( 1996 ) Cost allocation in continuous-review inventory models . Naval Research Logistics , 43 , 549 – 561 .
   Web of Science ®Google Scholar
• Roth , A.E. and Verrecchia , R.E. ( 1979 ) The Shapley value as applied to cost allocation a reinterpretation . Journal of Accounting Research , 17 , 295 – 303 .
   Web of Science ®Google Scholar
• Tijs , S. , Parthasarathy , T. , Potters , J.A.M. and Prasad , V.R. ( 1984 ) Permutation games another class of totally balanced games . OR Spektrum , 6 , 119 – 123 .
   Web of Science ®Google Scholar
• Curiel , I. , Pederzoli , G. and Tijs , S. ( 1989 ) Sequencing games . European Journal of Operational Research , 40 , 344 – 351 .
   Web of Science ®Google Scholar
• Curiel , I. , Potters , J. , Prasad , R. , Tijs , S. and Veltman , B. ( 1993 ) Cooperation in one machine scheduling . Zeitschrift für Operations Research , 38 , 113 – 129 .
   Google Scholar
• Curiel , I. , Potters , J. , Prasad , R. , Tijs , S. and Veltman , B. ( 1994 ) Sequencing and cooperation . Operations Research , 42 , 566 – 568 .
   Web of Science ®Google Scholar
• Pfaff , D. ( 1994 ) On the allocation of overhead costs . European Accounting Review , 1 , 49 – 70 .
   Google Scholar
• Emmons , H. ( 1969 ) One-machine sequencing to minimize certain functions of job tardiness . Operations Research , 17 , 701 – 715 .
   Web of Science ®Google Scholar
• Schrage , L. and Baker , K.R. ( 1978 ) Dynamic programming solution of sequencing problems with precedence constraints . Operations Research , 26 , 444 – 449 .
   Web of Science ®Google Scholar
• Potts , C.N. and van Wassenhove , L.N. ( 1982 ) A decomposition algorithm for the single machine total tardiness problem . Operations Research Letters , 1 , 177 – 181 .
   Google Scholar
• Russell , R.M. and Holsenback , J.E. ( 1997 ) Evaluation of leading heuristics for the single machine tardiness problem . European Journal of Operational Research , 96 , 538 – 545 .
   Web of Science ®Google Scholar
• Baker , K.R. and Bertrand , J.W.M. ( 1982 ) A dynamic priority rule for scheduling against due-dates . Journal of Operations Management , 3 , 37 – 42 .
   Google Scholar
• Raghu , T.S. and Rajendran , C. ( 1993 ) An efficient dynamic dispatching rule for scheduling in a job shop . International Journal of Production Economics , 32 , 301 – 313 .
   Web of Science ®Google Scholar
• Du , J. and Leung , J.Y.-T. ( 1990 ) Minimizing total tardiness on one machine is NP-hard . Mathematics of Operations Research , 15 , 483 – 495 .
   Web of Science ®Google Scholar
• Nawaz , M. , Enscore , E.E. and Ham , I. ( 1983 ) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem . Omega , 11 , 91 – 95 .
   Web of Science ®Google Scholar
• Haupt , R. ( 1989 ) A survey of priority rule-based scheduling . OR Spektrum , 11 , 3 – 16 .
   Google Scholar
• Pazner , E.A. and Schmeidler , D. ( 1974 ) A difficulty in the concept of fairness . Review of Economic Studies , 41 , 441 – 443 .
   Web of Science ®Google Scholar
• Crawford , V.P. ( 1979 ) A procedure for generating Pareto-effitient egalitarian-equivalent allocations . Econometrica , 47 , 49 – 60 .
   Web of Science ®Google Scholar
• Shapley , L.S. ( 1953 ) A value for n-person games , in Contributions to the Theory of Games , Vol. II , Kuhn, H.W. and Tucker, A.W. (eds) , Princeton University Press , Princeton , NJ , pp. 307 – 317 .
   Google Scholar
• Otten , G.-J. ( 1993 ) Characterizations of a game theoretical cost allocation method . Zeitschrift für Operations Research , 38 , 175 – 185 .
   Google Scholar
• Fisher , M.L. ( 1976 ) A dual algorithm for the one-machine scheduling problem . Mathematical Programming , 11 , 229 – 251 .
   Web of Science ®Google Scholar