{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:42:02Z","timestamp":1725514922221},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_9","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:56:32Z","timestamp":1182527792000},"page":"112-126","source":"Crossref","is-referenced-by-count":2,"title":["A Global Constraint for Total Weighted Completion Time"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Kov\u00e1cs","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_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., Sviridenko, M.: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. In: Proc. of the 40th IEEE Symposium on Foundations of Computer Science, pp. 32\u201344 (1999)","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/S0377-2217(03)00415-6","volume":"159","author":"C. Akkan","year":"2004","unstructured":"Akkan, C., Karabat\u0131, S.: The Two-machine Flowshop Total Completion Time Problem: Improved Lower Bounds and a Branch-and-bound Algorithm. European Journal of Operational Research\u00a0159, 420\u2013429 (2004)","journal-title":"European Journal of Operational Research"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J.M. Akker van den","year":"2000","unstructured":"van den Akker, J.M., Hurkens, C.A.J., Savelsbergh, M.W.P.: Time-indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS Journal on Computing\u00a012, 111\u2013124 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0377-2217(03)00378-3","volume":"158","author":"P. Baptiste","year":"2004","unstructured":"Baptiste, P., Carlier, J., Jouglet, A.: A Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with Arbitrary Release Dates. European Journal of Operational Research\u00a0158, 595\u2013608 (2004)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00353-8","volume":"144","author":"P. Baptiste","year":"2003","unstructured":"Baptiste, P., Peridy, L., Pinson, E.: A Branch and Bound to Mininimze the Number of Late Jobs on a Single Machine with Release Time Constraints. European Journal of Operational Research\u00a0144(1), 1\u201311 (2003)","journal-title":"European Journal of Operational Research"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0166-218X(92)90255-9","volume":"36","author":"H. Belouadah","year":"1992","unstructured":"Belouadah, H., Posner, M.E., Potts, C.N.: Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time. Discrete Applied Mathematics\u00a036, 213\u2013231 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR7","first-page":"21","volume-title":"Handbook of Combinatorial Optimization, vol. 3","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A Review of Machine Scheduling: Complexity, Algorithms and Approximation. In: Handbook of Combinatorial Optimization, vol. 3, pp. 21\u2013169. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","volume":"139","author":"F. Della Croce","year":"2002","unstructured":"Della Croce, F., Ghirardi, M., Tadei, R.: An Improved Branch-and-bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem. European Journal of Operational Research\u00a0139, 293\u2013301 (2002)","journal-title":"European Journal of Operational Research"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M. Dyer","year":"1990","unstructured":"Dyer, M., Wolsey, L.A.: Formulating the Single Machine Sequencing Problem with Release Dates as Mixed Integer Program. Discrete Applied Mathematics\u00a026, 255\u2013270 (1990)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/A:1014492408220","volume":"34","author":"F. Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Embedding Relaxations in Global Constraints for Solving TSP and TSPTW. Annals of Mathematics and Artificial Intelligence\u00a034(4), 291\u2013311 (2002)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3-4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1020589922418","volume":"7","author":"F. Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Optimization-Oriented Global Constraints. Constraints\u00a07(3-4), 351\u2013365 (2002)","journal-title":"Constraints"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1137\/S089548019936223X","volume":"15","author":"M.X. Goemans","year":"2002","unstructured":"Goemans, M.X., Queyranne, M., Schulz, A.S., Skutella, M., Wang, Y.: Single Machine Scheduling with Release Dates. SIAM Journal on Discrete Mathematics\u00a015(2), 165\u2013192 (2002)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9_CR13","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"A. Jouglet","year":"2004","unstructured":"Jouglet, A., Baptiste, P., Carlier, J.: Branch-and-Bound Algorithms for Total Weighted Tardiness. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapman & Hall \/ CRC, Boca Raton (2004)"},{"key":"9_CR14","unstructured":"K\u00e9ri, A., Kis, T.: Primal-dual Combined with Constraint Propagation for Solving RCPSPWET. In: Proc. of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 748\u2013751 (2005)"},{"key":"9_CR15","unstructured":"Nessah, R., Yalaoui, F., Chu, C.: A Branch-and-bound Algorithm to Minimize Total Weighted Completion Time on Identical Parallel Machines with Job Release Dates. Computers and Operations Research (in print)"},{"key":"9_CR16","unstructured":"Pan, Y.: Test Instances for the Dynamic Single-machine Sequencing Problem to Minimize Total Weighted Completion Time, Available at \n                  \n                    http:\/\/www.cs.wisc.edu\/~yunpeng\/test\/sm\/dwct\/instances.htm"},{"key":"9_CR17","unstructured":"Pan, Y., Shi, L.: New Hybrid Optimization Algorithms for Machine Scheduling Problems. IEEE Transactions on Automation Science and Engineering (in print)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-61310-2_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"A.S. Schulz","year":"1996","unstructured":"Schulz, A.S.: Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 301\u2013315. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:35:52Z","timestamp":1550385352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}