{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:30:09Z","timestamp":1779316209132,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10479-004-5030-1","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T18:45:20Z","timestamp":1108752320000},"page":"163-174","source":"Crossref","is-referenced-by-count":45,"title":["Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time"],"prefix":"10.1007","volume":"133","author":[{"given":"C. T.","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. Edwin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Janiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5385030_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., J.E. Hopcroft, and J.D. Ullman. (1974). The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley."},{"key":"5385030_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0925-5273(00)00040-2","volume":"69","author":"D. Biskup","year":"2001","unstructured":"Biskup, D. and H. Jahnke. (2001). \u201cCommon Due Date Assignment for Scheduling on a Single Machine with Jointly Reducible Processing Times.\u201d International Journal of Production Economics 69, 317\u2013322.","journal-title":"International Journal of Production Economics"},{"key":"5385030_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. B\u0142azewicz","year":"1996","unstructured":"B\u0142azewicz, J. (1996). Scheduling Computer and Manufacturing Processes. Berlin: Springer."},{"key":"5385030_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0167-6377(97)00010-2","volume":"21","author":"Z.L. Chen","year":"1997","unstructured":"Chen, Z.L., Q. Lu, and G. Tang. (1997). \u201cSingle Machine Scheduling with Discretely Controllable Processing Times.\u201d Operations Research Letters 21, 69\u201376.","journal-title":"Operations Research Letters"},{"key":"5385030_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/(SICI)1520-6750(199802)45:1<67::AID-NAV4>3.0.CO;2-J","volume":"45","author":"T.C.E. Cheng","year":"1998","unstructured":"Cheng, T.C.E. (1998). \u201cSingle Machine Scheduling to Minimize the Sum of Compression and Late Costs.\u201d Naval Research Logistics 45, 67\u201382.","journal-title":"Naval Research Logistics"},{"key":"5385030_CR6","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1109\/9.293187","volume":"39","author":"T.C.E. Cheng","year":"1994","unstructured":"Cheng, T.C.E. and A. Janiak. (1994). \u201cResource Optimal Control in Single-Machine Scheduling with Completion Time Constraints.\u201d IEEE Transactions on Automatic Control 39, 1243\u20131246.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5385030_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0167-6377(95)00011-8","volume":"17","author":"T.C.E. Cheng","year":"1995","unstructured":"Cheng, T.C.E. and M.Y. Kovalyov. (1995). \u201cSingle Machine Batch Scheduling with Deadlines and Resource Dependent Processing Times.\u201d Operations Research Letters 17, 243\u2013249.","journal-title":"Operations Research Letters"},{"key":"5385030_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0377-2217(00)00312-X","volume":"135","author":"T.C.E. Cheng","year":"2001","unstructured":"Cheng, T.C.E., A. Janiak, and M.Y. Kovalyov. (2001). \u201cSingle Machine Batch Scheduling with Resource Dependent Setup and Processing Times.\u201d European Journal of Operational Research 135, 177\u2013183.","journal-title":"European Journal of Operational Research"},{"key":"5385030_CR9","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"Conway, R.W., W.L. Maxwell, and L.W. Miller. (1967). Theory of Scheduling. Reading: Addison-Wesley."},{"key":"5385030_CR10","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton: Princeton Univ. Press."},{"key":"5385030_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L. (1979). \u201cOptimization and Approximation in Deterministic Machine Scheduling: A Survey.\u201d Annals of Discrete Mathematics 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"5385030_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-4976-8","volume-title":"Group Technology: Applications to Production Management","author":"I. Ham","year":"1985","unstructured":"Ham, I., K. Hitomy, and T. Yoshida. (1985). Group Technology: Applications to Production Management. Boston: Kluwer\/Nijhoff."},{"key":"5385030_CR13","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/0005-1098(86)90014-2","volume":"22","author":"A. Janiak","year":"1986","unstructured":"Janiak, A. (1986). \u201cTime-Optimal Control in a Single Machine Problem with Resource Constraints.\u201d Automatica 22, 745\u2013747.","journal-title":"Automatica"},{"key":"5385030_CR14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0377-2217(91)90065-4","volume":"53","author":"A. Janiak","year":"1991","unstructured":"Janiak, A. (1991). \u201cSingle Machine Scheduling Problem with a Common Deadline and Resource Dependent Release Dates.\u201d European Journal of Operational Research 53, 317\u2013325.","journal-title":"European Journal of Operational Research"},{"key":"5385030_CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02099697","volume":"57","author":"A. Janiak","year":"1995","unstructured":"Janiak, A. and M.Y. Kovalyov. (1995). \u201cSingle Machine Group Scheduling with Ordered Criteria.\u201d Annals of Operations Research 57, 191\u2013201.","journal-title":"Annals of Operations Research"},{"key":"5385030_CR16","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","volume":"94","author":"A. Janiak","year":"1996","unstructured":"Janiak, A. and M.Y. Kovalyov. (1996). \u201cSingle Machine Scheduling with Deadlines and Resource Dependent Processing Times.\u201d European Journal of Operational Research 94, 284\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"5385030_CR17","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.ejor.2002.11.004","volume":"162","author":"A. Janiak","year":"2005","unstructured":"Janiak, A., M.Y. Kovalyov, and M.-C. Portmann. (2005). \u201cSingle Machine Group Scheduling with Resource Dependent Setup and Processing Times.\u201d European Journal of Operational Research 162, 112\u2013121.","journal-title":"European Journal of Operational Research"},{"key":"5385030_CR18","first-page":"283","volume-title":"Proceedings of the International Conference on Industrial Engineering and Production Management","author":"A. Janiak","year":"1997","unstructured":"Janiak, A. and M.-C. Portmann. (1997). \u201cMinimization of the Maximum Lateness in Single Machine Scheduling with Release Dates and Additional Resources.\u201d In Proceedings of the International Conference on Industrial Engineering and Production Management. Lyon: Book I, pp. 283\u2013292."},{"key":"5385030_CR19","first-page":"61","volume":"12","author":"A. Janiak","year":"2001","unstructured":"Janiak, A., Y.M. Shafransky, and A.V. Tuzikov. (2001). \u201cSequencing with Ordered Criteria, Precedence and Group Technology Constraints.\u201d Informatica 12, 61\u201388.","journal-title":"Informatica"},{"key":"5385030_CR20","first-page":"635","volume":"4","author":"M.Y. Kovalyov","year":"1994","unstructured":"Kovalyov, M.Y. and A.V. Tuzikov. (1994). \u201cGroup Sequencing Subject to Precedence Constraints.\u201d Applied Mathematics and Computer Science 4, 635\u2013641.","journal-title":"Applied Mathematics and Computer Science"},{"key":"5385030_CR21","first-page":"946","volume":"42","author":"C.L. Li","year":"1994","unstructured":"Li, C.L., E.C. Sewell, and T.C.E. Cheng. (1994). \u201cScheduling to Minimize Release-Time Resource Consumption and Tardiness Penalties.\u201d Naval Research Logistics 42, 946\u2013966.","journal-title":"Naval Research Logistics"},{"key":"5385030_CR22","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0925-5273(96)00105-3","volume":"51","author":"M.M. Liaee","year":"1997","unstructured":"Liaee, M.M. and H. Emmons. (1997). \u201cScheduling Families of Jobs with Setup Times.\u201d International Journal of Production Economics 51, 165\u2013176.","journal-title":"International Journal of Production Economics"},{"key":"5385030_CR23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009841719644","volume":"3","author":"Z. Liu","year":"1999","unstructured":"Liu, Z. and W. Yu. (1999). \u201cMinimizing the Number of Late Jobs under the Group Technology Assumption.\u201d Journal of Combinatorial Optimization 3, 5\u201315.","journal-title":"Journal of Combinatorial Optimization"},{"key":"5385030_CR24","volume-title":"Scientific Principles of Group Technology","author":"S.P. Mitrofanovo","year":"1966","unstructured":"Mitrofanovo, S.P. (1966). Scientific Principles of Group Technology. Translated by E. Harris. Yorkshire: National Lending Library."},{"key":"5385030_CR25","volume-title":"A Classification System to Describe Workpieces: Parts I and II","author":"H. Opitz","year":"1970","unstructured":"Opitz, H. (1970). A Classification System to Describe Workpieces: Parts I and II. Oxford: Pergamon."},{"key":"5385030_CR26","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C.N. Potts","year":"2000","unstructured":"Potts, C.N. and M.Y. Kovalyov. (2000). \u201cScheduling with Batching: A Review.\u201d European Journal of Operational Research 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"5385030_CR27","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"C.N. Potts","year":"1991","unstructured":"Potts, C.N. and L.N. Van Wassenhove. (1991). \u201cIntegrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity.\u201d Journal of the Operational Research Society 43, 395\u2013406.","journal-title":"Journal of the Operational Research Society"},{"key":"5385030_CR28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-6377(92)90027-Z","volume":"11","author":"D.F. Shallcross","year":"1992","unstructured":"Shallcross, D.F. (1992). \u201cA Polynomial Algorithm for a One Machine Batching Problem.\u201d Operations Research Letters 11, 213\u2013218.","journal-title":"Operations Research Letters"},{"key":"5385030_CR29","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"1","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E. (1956). \u201cVarious Optimizers for Single-Stage Production.\u201d Naval Research Logistics Quarterly 1, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"5385030_CR30","doi-asserted-by":"crossref","first-page":"1585","DOI":"10.1016\/0041-5553(84)90181-2","volume":"24","author":"A.V. Tuzikov","year":"1984","unstructured":"Tuzikov, A.V. (1984). \u201cA Two-Criterion Scheduling Problem Allowing Variation in Job Execution.\u201d USSR Computing Mathematics and Mathematical Physics 24, 1585\u20131590.","journal-title":"USSR Computing Mathematics and Mathematical Physics"},{"key":"5385030_CR31","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","volume":"11","author":"L.N. Wassenhove Van","year":"1982","unstructured":"Van Wassenhove, L.N. and K.R. Baker. (1982). \u201cA Bicriterion Approach to Time\/Cost Tradeoffs in Sequencing.\u201d European Journal of Operational Research 11, 48\u201354.","journal-title":"European Journal of Operational Research"},{"key":"5385030_CR32","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"R.G. Vickson","year":"1980","unstructured":"Vickson, R.G. (1980). \u201cTwo Single Machine Sequencing Problems Involving Controllable Job Processing Times.\u201d AIIE Transactions 12, 258\u2013262.","journal-title":"AIIE Transactions"},{"key":"5385030_CR33","first-page":"1132","volume":"20","author":"L.Y. Zamanskii","year":"1984","unstructured":"Zamanskii, L.Y. and V.L. Cherkasskii. (1984). \u201cA Formula for Finding the Number of Integer Points under a Straight Line and Its Applications.\u201d Economika i Matematicheskie Metodi 20, 1132\u20131138 (in Russian).","journal-title":"Economika i Matematicheskie Metodi"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-004-5030-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-004-5030-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-004-5030-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:59:33Z","timestamp":1559152773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-004-5030-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":33,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["5385030"],"URL":"https:\/\/doi.org\/10.1007\/s10479-004-5030-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}