{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:15Z","timestamp":1725501075147},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_28","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T05:49:24Z","timestamp":1189748964000},"page":"305-316","source":"Crossref","is-referenced-by-count":1,"title":["A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers"],"prefix":"10.1007","author":[{"given":"Xiaobing","family":"Gan","sequence":"first","affiliation":[]},{"given":"Yanhong","family":"Gu","sequence":"additional","affiliation":[]},{"given":"George L.","family":"Vairaktarakis","sequence":"additional","affiliation":[]},{"given":"Xiaoqiang","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Quanle","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Anger, F.D., Lee, C.-Y., Martin-Vega, L.A.: Single Machine Scheduling with Tight Windows. Research Report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FloridaTransportation Science, pp. 86\u201316 (1986)"},{"key":"28_CR2","first-page":"262","volume":"6","author":"F.-J. Kramer","year":"1997","unstructured":"Kramer, F.-J., Lee, C.-Y.: Common Due Window Scheduling. Production and Operations Management\u00a06, 262\u2013275 (1997)","journal-title":"Production and Operations Management"},{"key":"28_CR3","unstructured":"Lee, C.-Y.: Earliness-Tardiness Scheduling Problems with Constant Size of Due Date Window. Research Report, Department of Industrial and System Engineering, University of Florida, Gainesville, Florida, pp. 91\u201317 (1991)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0167-6377(94)90078-7","volume":"15","author":"S.D. Liman","year":"1994","unstructured":"Liman, S.D., Ramaswamy, S.: Earliness-Tardiness Scheduling Problems with a Common Delivery Window. Operations Research Letters\u00a015, 195\u2013203 (1994)","journal-title":"Operations Research Letters"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(95)00181-6","volume":"93","author":"S.D. Liman","year":"1996","unstructured":"Liman, S.D., Panwlker, S.S., Thongmee, S.: Determination of Common Due Window Location in a Singer Machine Scheduling Problem. European Journal of Operational Research\u00a093, 68\u201374 (1996)","journal-title":"European Journal of Operational Research"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/0377-2217(95)00116-6","volume":"91","author":"C. Koulamas","year":"1996","unstructured":"Koulamas, C.: Single-Machine Scheduling with Time Window and Earliness\/Tardiness Penalties. European Journal of Operational Research\u00a091, 190\u2013202 (1996)","journal-title":"European Journal of Operational Research"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1057\/palgrave.jors.0470309","volume":"47","author":"J.A. Ventura","year":"1996","unstructured":"Ventura, J.A., Weng, M.X.: Single Machine Scheduling with a Common Delivery Window. Journal of the Operational Research Society\u00a047, 424\u2013434 (1996)","journal-title":"Journal of the Operational Research Society"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0895-7177(97)00074-5","volume":"25","author":"C. Koulamas","year":"1997","unstructured":"Koulamas, C.: Maximizing the Weighted Number of On-Time Jobs in Single Machine Scheduling with Time Windows. Math. Comput. Modelling\u00a025, 57\u201362 (1997)","journal-title":"Math. Comput. Modelling"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","volume":"49","author":"S.D. Liman","year":"1998","unstructured":"Liman, S.D., Panwalkar, S.S., Thongmee, S.: Common Due Window Size and Location Determination in a Single Machine Scheduling Problem. Journal of the Operational Research Society\u00a049, 1007\u20131010 (1998)","journal-title":"Journal of the Operational Research Society"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1018965919691","volume":"70","author":"S.D. Liman","year":"1997","unstructured":"Liman, S.D., Panwalkar, S.S., Thongmee, S.: Scheduling Common Due Window Problems with Controllable Processing Times. Annals of Operations Research\u00a070, 145\u2013154 (1997)","journal-title":"Annals of Operations Research"},{"key":"28_CR11","first-page":"440","volume":"15","author":"Q.-L. Chen","year":"2000","unstructured":"Chen, Q.-L., Sun, S.-J.: An Earliness and Tardiness Problem in Single Machine Scheduling wiht a Common Due Window. Applied Mathematics- a Journal of Chinese universities SerA\u00a015, 440\u2013448 (2000)","journal-title":"Applied Mathematics- a Journal of Chinese universities SerA"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/S0377-2217(01)00068-6","volume":"136","author":"Z.-L. Chen","year":"2002","unstructured":"Chen, Z.-L., Lee, C.-Y.: A Column Generation Algorithm for Parallel Machine Common Due Window Scheduling. European Journal of Operational Research\u00a0136, 512\u2013527 (2002)","journal-title":"European Journal of Operational Research"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0377-2217(01)00302-2","volume":"142","author":"B. Yen","year":"2002","unstructured":"Yen, B., Wan, G.: Tabu Search for Total Weighted Earliness and Tardiness Minimizing on Single Machine with Distinct Due Windows. European Journal of Operational Research\u00a0142, 271\u2013281 (2002)","journal-title":"European Journal of Operational Research"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.R. Baker","year":"1990","unstructured":"Baker, K.R., Scudder, G.D.: Sequencing with Earliness and Tardiness Penalties: A Review. Oper. Res.\u00a038, 22\u201336 (1990)","journal-title":"Oper. Res."},{"key":"28_CR15","first-page":"206","volume-title":"Proc. 18th Annual Symposium on Foundation of Computer Science","author":"E.L. Lawler","year":"1977","unstructured":"Lawler, E.L.: Fast Approximation Algorithms for Knapsack Problems. In: Proc. 18th Annual Symposium on Foundation of Computer Science, pp. 206\u2013213. IEEE Computer Society, Long Beach, CA (1977)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.2307\/1906951","volume":"21","author":"J. Nash","year":"1953","unstructured":"Nash, J.: Two Person Cooperative Games. Econometrica\u00a021, 128\u2013140 (1953)","journal-title":"Econometrica"},{"key":"28_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511607950","volume-title":"Bargaining Theory with Application","author":"A. Muthoo","year":"1999","unstructured":"Muthoo, A.: Bargaining Theory with Application. Cambridge University Press, Cambridge (1999)"},{"key":"28_CR18","unstructured":"Zhang, D.: A logical Model of Nash Bargaining Solution. In: Proceeding of IJCAI, pp. 983\u2013990 (2005)"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s100580200069","volume":"7","author":"W. Trockel","year":"2002","unstructured":"Trockel, W.: Integrating the Nash Program into Mechanism Theory. Review of Economic Design\u00a07, 27\u201343 (2002)","journal-title":"Review of Economic Design"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00199-004-0470-z","volume":"25","author":"W. Trockel","year":"2005","unstructured":"Trockel, W.: Core-equivalence for the Nash Bargaining Solution. Economic Theory\u00a025, 255\u2013263 (2005)","journal-title":"Economic Theory"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s003550200159","volume":"19","author":"N. Dagan","year":"2002","unstructured":"Dagan, N., Volij, O., Winter, E.: A Characterization of the Nash Bargaining Solution. Social Choice and Welfare\u00a019, 811\u2013823 (2002)","journal-title":"Social Choice and Welfare"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Touati, C., Altman, E., Galtier, J.: Generalized Nash Bargaining Solution for Bandwidth Allocation. Computer Networks (in press)","DOI":"10.1016\/j.comnet.2005.12.006"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s003550100150","volume":"19","author":"R. Nagahisa","year":"2002","unstructured":"Nagahisa, R., Tanaka, M.: An axiomatization of the Kalai-Smorodinsky Solution when the Feasible Sets can be Finite. Social Choice and Welfare\u00a019, 751\u2013761 (2002)","journal-title":"Social Choice and Welfare"},{"key":"28_CR24","first-page":"207","volume":"14","author":"S. Lahiri","year":"2004","unstructured":"Lahiri, S.: Axiomatic Characterization of the Nash and Kalai-Smorodinsky Solutions for Discrete Bargaining Problems. PU.M.A\u00a014, 207\u2013220 (2004)","journal-title":"PU.M.A"},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s003550050114","volume":"15","author":"M. Mariotti","year":"1998","unstructured":"Mariotti, M.: Nash Bargaining Theory when the Number of Alternatives can be Finite. Social Choice and Welfare\u00a015, 413\u2013421 (1998)","journal-title":"Social Choice and Welfare"},{"key":"28_CR26","unstructured":"Chen, Q.-L.: A New Discrete Bargaining Model on Job Partition Between Two Manufacturers. PhD Dissertation, The Chinese University of Hongkong (2006)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:09Z","timestamp":1619519289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}