{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T13:10:04Z","timestamp":1743858604905,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_19","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"212-222","source":"Crossref","is-referenced-by-count":0,"title":["Resource Scheduling with Supply Constraint and Linear Cost"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenkom, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 32\u201343 (1999)","DOI":"10.1109\/SFFCS.1999.814574"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research\u00a0112(1), 3\u201341 (1999)","journal-title":"European Journal of Operational Research"},{"key":"19_CR3","unstructured":"Conway, R., Maxwell, W., Miller, L.: Theory of scheduling. Dover Publications (2003)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 1064\u20131073 (2006)","DOI":"10.1145\/1109557.1109675"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Feige, U., Vondrak, J.: Approximation algorithms for allocation problems: Improving the factor of 1-1\/e. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 667\u2013676 (2006)","DOI":"10.1109\/FOCS.2006.14"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Fishkin, A., Jansen, K., Porkolab, L.: On minimizing average weighted completion time: A ptas for scheduling general multiprocessor tasks. In: Proceedings of the 13th International Symposium on Fundamentals of Computation Theory, pp. 495\u2013507 (2001)","DOI":"10.1007\/3-540-44669-9_56"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing\u00a04, 397 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR8","volume-title":"Computers and intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.074","volume":"189","author":"J. Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves, J., Mendes, J., Resende, M.: A genetic algorithm for the resource constrained multi-project scheduling problem. European Journal of Operational Research\u00a0189(3), 1171\u20131190 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics\u00a05(2), 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Graves, S.C.: A review of production scheduling. Operations Research, 646\u2013675 (1981)","DOI":"10.1287\/opre.29.4.646"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S. Hartmann","year":"2010","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research\u00a0207(1), 1\u201314 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ejor.2004.04.002","volume":"165","author":"W. Herroelen","year":"2005","unstructured":"Herroelen, W., Leus, R.: Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research\u00a0165(2), 289\u2013306 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R. Kolisch","year":"1996","unstructured":"Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research\u00a090(2), 320\u2013333 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R. Kolisch","year":"2006","unstructured":"Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research\u00a0174(1), 23\u201337 (2006)","journal-title":"European Journal of Operational Research"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Leung, J.Y.T.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press (2004)","DOI":"10.1201\/9780203489802"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Mirrokni, V., Schapira, M., Vondr\u00e1k, J.: Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In: Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 70\u201377 (2008)","DOI":"10.1145\/1386790.1386805"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jet.2004.10.007","volume":"129","author":"N. Nisan","year":"2006","unstructured":"Nisan, N., Segal, I.: The communication requirements of efficient allocations and supporting prices. Journal of Economic Theory\u00a0129(1), 192\u2013224 (2006)","journal-title":"Journal of Economic Theory"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Skutella, M., Woeginger, G.: A ptas for minimizing the weighted sum of job completion times on parallel machines. In: Proceedings of the 31th Annual ACM Symposium on Theory of Computing, pp. 400\u2013407. ACM (1999)","DOI":"10.1145\/301250.301356"},{"issue":"1-2","key":"19_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly\u00a03(1-2), 59\u201366 (1956)","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T12:29:54Z","timestamp":1743856194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}