{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:48:13Z","timestamp":1772761693482,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1022239620866","type":"journal-article","created":{"date-parts":[[2003,3,28]],"date-time":"2003-03-28T22:23:32Z","timestamp":1048890212000},"page":"87-108","source":"Crossref","is-referenced-by-count":7,"title":["Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs"],"prefix":"10.1007","volume":"6","author":[{"given":"Alessandro","family":"Agnetis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arianna","family":"Alfieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaia","family":"Nicosia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5114682_CR1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/mnsc.39.3.294","volume":"39","author":"A. Agnetis","year":"1993","unstructured":"Agnetis, A., M. Lucertini, and F. Nicol\u00f2, \u201cFlow management in flexible manufacturing cells with pipeline operations,\u201d Manag. Sci., 39, 294-306 (1993).","journal-title":"Manag. Sci."},{"key":"5114682_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, \u201cBranch-and-price: column generation for solving huge integer programs,\u201d Oper. Res., 46, 316-329 (1998).","journal-title":"Oper. Res."},{"key":"5114682_CR3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes. Springer, Berlin, 1996, pp. 114-116."},{"key":"5114682_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C. N. Potts, T. Tautenhahn and S.L. van de Velde, \u201cScheduling a batching machine,\u201d J. Sched., 1, 31-54 (1998).","journal-title":"J. Sched."},{"key":"5114682_CR5","unstructured":"Chein, M. and P. Martin, \u201cSur le nombre de sauts d'une foret,\u201d C. R. Acad. Sci. Paris 275, serie A, 158-161 (1972)."},{"key":"5114682_CR6","doi-asserted-by":"crossref","first-page":"2171","DOI":"10.1080\/00207549008942860","volume":"28","author":"H.C. Co","year":"1990","unstructured":"Co, H.C., J. S. Biermann, and S. K. Chen, \u201cA methodical approach to the flexible manufacturing system batching, loading and tool configuration problems,\u201d Int. J. Prod. Res., 28, 2171-2186 (1990).","journal-title":"Int. J. Prod. Res."},{"key":"5114682_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M. Desrochers","year":"1989","unstructured":"Desrochers, M. and F. Soumis, \u201cA column generation approach to the urban transit crew scheduling problem,\u201d Transport. Sci., 23, 1-13 (1989).","journal-title":"Transport. Sci."},{"key":"5114682_CR8","unstructured":"Garey, M. R. and D. S. Johnson, Computers and Intractability Freeman, 1979"},{"key":"5114682_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(00)00181-5","volume":"105","author":"Z. Liu","year":"2000","unstructured":"Liu, Z. and W. Yu, \u201cScheduling one batch processor subject to job release dates,\u201d Discrete Appl. Math., 105, 129-136 (2000).","journal-title":"Discrete Appl. Math."},{"key":"5114682_CR10","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D., \u201cThe complexity of some problems on subsequences and supersequences,\u201d J. ACM, 25, 322-336 (1978).","journal-title":"J. ACM"},{"key":"5114682_CR11","doi-asserted-by":"crossref","unstructured":"Nemhauser, G. and L. Wolsey, Integer and Combinatorial Optimization Wiley Intescience, 1988.","DOI":"10.1002\/9781118627372"},{"key":"5114682_CR12","unstructured":"Pulleyblank, W. R., \u201cOn minimizing setups in precedence constrained scheduling,\u201d Report 81105-OR. University of Bonn, 1975."},{"key":"5114682_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","volume":"16","author":"K. R\u00e4ih\u00e4","year":"1981","unstructured":"R\u00e4ih\u00e4, K. and E. Ukkonen, \u201cThe shortest common Supersequence problem over binary alphabet is NP-complete,\u201d Theoretical Comput. Sci., 16, 187-198 (1981).","journal-title":"Theoretical Comput. Sci."},{"key":"5114682_CR14","first-page":"269","volume-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"B. M. Ryan","year":"1981","unstructured":"Ryan, B. M. and B. A. Foster, \u201cAn integer Programming Approach to Scheduling,\u201d in A. Wren (ed.), Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, Amsterdam, North Holland, 1981, pp. 269-280."},{"key":"5114682_CR15","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0360-8352(99)00147-3","volume":"36","author":"S. Samaddar","year":"1999","unstructured":"Samaddar, S., G. Rabinowitz, and A. Mehrez, \u201cResource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell,\u201d Comput. Indust. Eng., 36, 525-547 (1999).","journal-title":"Comput. Indust. Eng."},{"key":"5114682_CR16","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00713157","volume":"1","author":"K. E. Stecke","year":"1988","unstructured":"Stecke, K. E. and I. Kim, \u201cStudy of FMS part type selection approaches for short term production planning,\u201d Int. J. Flexible Manufact. Syst., 1, 7-29 (1988).","journal-title":"Int. J. Flexible Manufact. Syst."},{"key":"5114682_CR17","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/opre.36.5.767","volume":"36","author":"C. S. Tang","year":"1988","unstructured":"Tang, C. S. and E. V. Denardo, \u201cModels arising from a flexible manufacturing machine, part I: minimization of the number of tool switches,\u201d Oper. Res., 36, 767-777 (1988a).","journal-title":"Oper. Res."},{"key":"5114682_CR18","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1287\/opre.36.5.778","volume":"36","author":"C. S. Tang","year":"1988","unstructured":"Tang, C. S. and E. V. Denardo, \u201cModels arising from a flexible manufacturing machine, part II: minimization of the number of switching instants,\u201d Oper. Res., 36, 778-784 (1988b).","journal-title":"Oper. Res."},{"key":"5114682_CR19","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/BF01075212","volume":"25","author":"V. G. Timkovsky","year":"1990","unstructured":"Timkovsky, V. G., \u201cComplexity of common subsequence and supersequence problems and related problems,\u201d Cybernetics, 25, 565-580 (1990).","journal-title":"Cybernetics"},{"key":"5114682_CR20","unstructured":"van den Akker, M., H. Hoogeveen, and S. van de Velde, \u201cCombining column generation and lagragian relaxation. An application to a single-machine common due date scheduling problem\u201d, Report No. 36-1998. Erasmus University Rotterdam, Rotterdam School of Management, Erasm Managment Series, 1998."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022239620866.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022239620866\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022239620866.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:50:25Z","timestamp":1751633425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022239620866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5114682"],"URL":"https:\/\/doi.org\/10.1023\/a:1022239620866","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}