{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:20:50Z","timestamp":1648902050166},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,12,22]],"date-time":"2009-12-22T00:00:00Z","timestamp":1261440000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s10601-009-9088-x","type":"journal-article","created":{"date-parts":[[2009,12,21]],"date-time":"2009-12-21T09:02:07Z","timestamp":1261386127000},"page":"100-123","source":"Crossref","is-referenced-by-count":4,"title":["A global constraint for total weighted completion time for unary resources"],"prefix":"10.1007","volume":"16","author":[{"given":"Andr\u00e1s","family":"Kov\u00e1cs","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,22]]},"reference":[{"key":"9088_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., et al. (1999). 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).","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"9088_CR2","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(03)00415-6","volume":"159","author":"C Akkan","year":"2004","unstructured":"Akkan, C., & Karabat\u0131, S. (2004). The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research, 159, 420\u2013429.","journal-title":"European Journal of Operational Research"},{"key":"9088_CR3","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0377-2217(03)00378-3","volume":"158","author":"Ph Baptiste","year":"2004","unstructured":"Baptiste, Ph., Carlier, J., & Jouglet, A. (2004). A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates. European Journal of Operational Research, 158, 595\u2013608.","journal-title":"European Journal of Operational Research"},{"key":"9088_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.disopt.2004.12.003","volume":"2","author":"Ph Baptiste","year":"2005","unstructured":"Baptiste, Ph., & Le Pape, C. (2005). Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optimization, 2, 83\u201399.","journal-title":"Discrete Optimization"},{"issue":"1","key":"9088_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00353-8","volume":"144","author":"Ph Baptiste","year":"2003","unstructured":"Baptiste, Ph., Peridy, L., & Pinson, E. (2003). A branch and bound to minimize the number of late jobs on a single machine with release time constraints. European Journal of Operational Research, 144(1), 1\u201311.","journal-title":"European Journal of Operational Research"},{"key":"9088_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"JC Beck","year":"2003","unstructured":"Beck, J. C., & Refalo, P. (2003). A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research, 118, 49\u201371.","journal-title":"Annals of Operations Research"},{"key":"9088_CR7","doi-asserted-by":"crossref","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. (1992). Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics, 36, 213\u2013231.","journal-title":"Discrete Applied Mathematics"},{"key":"9088_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(92)00176-M","volume":"48","author":"H Belouadah","year":"1994","unstructured":"Belouadah, H., & Potts, C. N. (1994). Scheduling identical parallel machines to minimize total weighted completion time. Discrete Applied Mathematics, 48, 201\u2013218.","journal-title":"Discrete Applied Mathematics"},{"key":"9088_CR9","volume-title":"Handbook of combinatorial optimization (Vol.\u00a03)","author":"B Chen","year":"1998","unstructured":"Chen, B., Potts, C. N., & Woeginger, G. J. (1998). A review of machine scheduling: Complexity, algorithms and approximation. In Handbook of combinatorial optimization (Vol.\u00a03). Deventer: Kluwer."},{"key":"9088_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49, 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"9088_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","volume":"139","author":"F Croce Della","year":"2002","unstructured":"Della Croce, F., Ghirardi, M., & Tadei, R. (2002). An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research, 139, 293\u2013301.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"9088_CR12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., & Rousseau, L.-M. (2006). A cost-regular based hybrid column generation approach. Constraints, 11(4), 315\u2013333.","journal-title":"Constraints"},{"key":"9088_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A Drexl","year":"1997","unstructured":"Drexl, A., & Kimms, A. (1997). Lot-sizing and scheduling\u2014survey and extensions. European Journal of Operational Research, 99, 221\u2013235.","journal-title":"European Journal of Operational Research"},{"key":"9088_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M Dyer","year":"1990","unstructured":"Dyer, M., & Wolsey, L.\u00a0A. (1990). Formulating the single machine sequencing problem with release dates as mixed integer program. Discrete Applied Mathematics, 26, 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"9088_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/A:1014492408220","volume":"34","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., & Milano, M. (2002). Embedding relaxations in global constraints for solving TSP and TSPTW. Annals of Mathematics and Artificial Intelligence, 34(4), 291\u2013311.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3\u20134","key":"9088_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1020589922418","volume":"7","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., & Milano, M. (2002). Optimization-oriented global constraints. Constraints, 7(3\u20134), 351\u2013365.","journal-title":"Constraints"},{"key":"9088_CR17","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman."},{"issue":"2","key":"9088_CR18","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1137\/S089548019936223X","volume":"15","author":"MX Goemans","year":"2002","unstructured":"Goemans, M. X., Queyranne, M., Schulz, A. S., Skutella, M., & Wang, Y. (2002). Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics, 15(2), 165\u2013192.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"9088_CR19","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10601-005-2807-z","volume":"10","author":"CP Gomes","year":"2005","unstructured":"Gomes, C. P., Fern\u00e1ndez, C., Selman, B., & Bessi\u00e8re, C. (2005). Statistical regimes across constrainedness regions. Constraints, 10(4), 317\u2013337.","journal-title":"Constraints"},{"key":"9088_CR20","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis, chapter\u00a013","author":"A Jouglet","year":"2004","unstructured":"Jouglet, A., Baptiste, P., & Carlier, J. (2004). Branch-and-bound algorithms for total weighted tardiness. In Handbook of scheduling: Algorithms, models, and performance analysis, chapter\u00a013. London: Chapman & Hall \/ CRC."},{"key":"9088_CR21","unstructured":"Kov\u00e1cs, A., & Beck, J.\u00a0C. (2007). Single-machine scheduling with tool changes: A constraint-based approach. In PlanSIG 2007, the 26th workshop of the UK planning and scheduling special interest group (pp. 71\u201378)."},{"issue":"5","key":"9088_CR22","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.engappai.2008.03.004","volume":"21","author":"A Kov\u00e1cs","year":"2008","unstructured":"Kov\u00e1cs, A., & Beck, J.\u00a0C. (2008). A global constraint for total weighted completion time for cumulative resources. Engineering Applications of Artificial Intelligence, 21(5), 691\u2013697.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"9088_CR23","unstructured":"K\u00e9ri, A., & Kis, T. (2005). 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)."},{"key":"9088_CR24","unstructured":"Le\u00a0Pape, C., Couronn\u00e9, P., Vergamini, D., & Gosselin, V. (1994). Time-versus-capacity compromises in project scheduling. In Proceedings of the thirteenth workshop of the UK planning special interest group."},{"key":"9088_CR25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., & Zuckerman, D. (1993). Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47, 173\u2013180.","journal-title":"Information Processing Letters"},{"issue":"4","key":"9088_CR26","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1016\/j.cor.2006.07.010","volume":"35","author":"R Nessah","year":"2009","unstructured":"Nessah, R., Yalaoui, F., & Chu, C. (2009). A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. Computers and Operations Research, 35(4), 1176\u20131190.","journal-title":"Computers and Operations Research"},{"key":"9088_CR27","unstructured":"Pan, Y. (2007). Test instances for the dynamic single-machine sequencing problem to minimize total weighted completion time. Available at www.cs.wisc.edu\/126yunpeng\/test\/sm\/dwct\/instances.htm ."},{"issue":"2","key":"9088_CR28","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TASE.2007.895005","volume":"5","author":"Y Pan","year":"2008","unstructured":"Pan, Y., & Shi, L. (2008). New hybrid optimization algorithms for machine scheduling problems. IEEE Transactions on Automation Science and Engineering, 5(2), 337\u2013348.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"9088_CR29","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C. (1999). Arc consistency for global cardinality constraints with costs. In Proceedings of principles and practice of constraint programming (LNCS 1713) (pp. 390\u2013404).","DOI":"10.1007\/978-3-540-48085-3_28"},{"key":"9088_CR30","first-page":"89","volume-title":"Constraint and integer programming: Toward a unified methodology","author":"J-C R\u00e9gin","year":"2003","unstructured":"R\u00e9gin, J.-C. (2003). Global constraints and filtering algorithms. In M. Milano (Ed.), Constraint and integer programming: Toward a unified methodology (pp. 89\u2013135). Deventer: Kluwer."},{"key":"9088_CR31","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1051\/ro:2005007","volume":"39","author":"J-C R\u00e9gin","year":"2005","unstructured":"R\u00e9gin, J.-C., & Rueher, M. (2005). Inequality-sum: A global constraint capturing the objective function. RAIRO Operations Research, 39, 123\u2013139.","journal-title":"RAIRO Operations Research"},{"key":"9088_CR32","unstructured":"Scheduler (2002). ILOG Scheduler 6.1 reference manual. ILOG, S.A."},{"key":"9088_CR33","doi-asserted-by":"crossref","unstructured":"Schulz, A. S. (1996). Scheduling to minimize total weighted completion time: Performance guarantees of lp-based heuristics and lower bounds. In Proc. of the 5th int. conf. on integer programming and combinatorial optimization (pp. 301\u2013315).","DOI":"10.1007\/3-540-61310-2_23"},{"key":"9088_CR34","doi-asserted-by":"crossref","unstructured":"Sellmann, M. (2002). An arc consistency algorithm for the minimum weight all different constraint. In Proceedings of principles and practice of constraint programming (LNCS 2470) (pp. 744\u2013749).","DOI":"10.1007\/3-540-46135-3_56"},{"key":"9088_CR35","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"JM Akker van den","year":"2000","unstructured":"van den Akker, J. M., Hurkens, C. A. J, & Savelsberg, M. W. P. (2000). Time-indexed formulations for machine scheduling problems: Column generation. INFORMS Journal on Computing, 12, 111\u2013124.","journal-title":"INFORMS Journal on Computing"},{"key":"9088_CR36","unstructured":"Watson, J. P., Barbulescu, L., Howe, A. E., & Whitley, L. D. (1999). Algorithms performance and problem structure for flow-shop scheduling. In Proceedings of the sixteenth national conference on artificial intelligence (AAAI-99) (pp. 688\u2013695)."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9088-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-009-9088-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9088-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:15Z","timestamp":1559243655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-009-9088-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,22]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9088"],"URL":"https:\/\/doi.org\/10.1007\/s10601-009-9088-x","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,22]]}}}