{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T04:38:39Z","timestamp":1772080719227,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10951-010-0162-4","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T20:53:00Z","timestamp":1265316780000},"page":"225-237","source":"Crossref","is-referenced-by-count":46,"title":["A job-shop problem with one additional resource type"],"prefix":"10.1007","volume":"14","author":[{"given":"Alessandro","family":"Agnetis","sequence":"first","affiliation":[]},{"given":"Marta","family":"Flamini","sequence":"additional","affiliation":[]},{"given":"Gaia","family":"Nicosia","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Pacifici","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"issue":"1","key":"162_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1111\/j.1475-3995.1995.tb00004.x","volume":"2","author":"A. Agnetis","year":"1995","unstructured":"Agnetis, A., & Oriolo, G. (1995). The machine duplication problem in a job shop with two jobs. International Transactions on Operational Research, 2(1), 45\u201360.","journal-title":"International Transactions on Operational Research"},{"issue":"3","key":"162_CR2","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/j.ejor.2009.07.001","volume":"202","author":"A. Agnetis","year":"2010","unstructured":"Agnetis, A., Flamini, M., Nicosia, G., & Pacifici, A. (2010). Scheduling three chains on two parallel machines. European Journal of Operational Research, 202(3), 669\u2013674.","journal-title":"European Journal of Operational Research"},{"key":"162_CR3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/opre.4.2.244","volume":"4","author":"S. B. Akers","year":"1956","unstructured":"Akers, S. B. (1956). A graphical approach to production scheduling problems. Operations Research, 4, 244\u2013255.","journal-title":"Operations Research"},{"issue":"2","key":"162_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/10556780410001657653","volume":"19","author":"M. F. Baki","year":"2004","unstructured":"Baki, M. F., & Vickson, R. G. (2004). One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective. Optimization Methods and Software, 19(2), 165\u2013178.","journal-title":"Optimization Methods and Software"},{"key":"162_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02186433","volume":"7","author":"J. Blazewicz","year":"1986","unstructured":"Blazewicz, J., Cellary, W., Slowinski, R., & Weglarz, J. (1986). Scheduling under resource constraints\u2013deterministic models. Annals of Operations Research, 7, 1\u2013359.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"162_CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02276919","volume":"40","author":"P. Brucker","year":"1988","unstructured":"Brucker, P. (1988). An efficient algorithm for the job-shop problem with two jobs. Computing, 40(4), 353\u2013359.","journal-title":"Computing"},{"key":"162_CR7","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.ejor.2004.04.010","volume":"165","author":"P. Brucker","year":"2005","unstructured":"Brucker, P., Knust, S., & Wang, G. (2005). Complexity results for flow-shop problems with a single server. European Journal of Operational Research, 165, 398\u2013407.","journal-title":"European Journal of Operational Research"},{"key":"162_CR8","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0377-2217(95)00350-9","volume":"90","author":"P. Brucker","year":"1996","unstructured":"Brucker, P., & Kr\u00e4mer, A. (1996). Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. European Journal of Operational Research, 90, 214\u2013226.","journal-title":"European Journal of Operational Research"},{"key":"162_CR9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11, 42\u201347.","journal-title":"European Journal of Operational Research"},{"key":"162_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J., & Pinson, E. (1990). A practical use of Jackson\u2019s preemptive schedule for solving the job shop problem. Annals of Operations Research, 26, 269\u2013287.","journal-title":"Annals of Operations Research"},{"key":"162_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H","volume":"46","author":"J. Chen","year":"1999","unstructured":"Chen, J., & Lee, C.-Y. (1999). General multiprocessor task scheduling. Naval Research Logistics, 46, 57\u201374.","journal-title":"Naval Research Logistics"},{"key":"162_CR12","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/S0305-0548(98)00087-2","volume":"26","author":"T. C. E. Cheng","year":"1999","unstructured":"Cheng, T. C. E., Wang, G., & Sriskandarajah, C. (1999). One-operator two-machine flowshop scheduling with setup and dismounting times. Computers & Operations Research, 26, 715\u2013730.","journal-title":"Computers & Operations Research"},{"key":"162_CR13","volume-title":"Computers and intractability","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. New York: Freeman."},{"key":"162_CR14","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1002\/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1","volume":"47","author":"C. A. Glass","year":"2000","unstructured":"Glass, C. A., Shafransky, Y. M., & Strusevich, V. A. (2000). Scheduling for parallel dedicated machines with a single server. Naval Research Logistics, 47, 304\u2013328.","journal-title":"Naval Research Logistics"},{"key":"162_CR15","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SSC-4","author":"P. E. Hart","year":"1968","unstructured":"Hart, P. E., Nilsson, N. J., & Raphael, B. (1968) A formal basis for he heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SSC-4, 100\u2013108.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"162_CR16","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. H. Ibarra","year":"1975","unstructured":"Ibarra, O. H., & Kim, C. (1975). Fast approximation algorithms for the knapsack and sum of subset problems. Journal of ACM, 22, 463\u2013468.","journal-title":"Journal of ACM"},{"key":"162_CR17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0377-2217(02)00246-1","volume":"174","author":"H. Kellerer","year":"2003","unstructured":"Kellerer, H., & Strusevich, V.A. (2003). Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operations Research, 174, 345\u2013364.","journal-title":"European Journal of Operations Research"},{"key":"162_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0166-218X(03)00433-5","volume":"133","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., & Strusevich, V. A. (2004). Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics, 133, 45\u201368.","journal-title":"Discrete Applied Mathematics"},{"key":"162_CR19","unstructured":"Roy, B., & Sussmann, B. (1964). Les problemes d\u2019ordonnancement avec constraintes disjonctives. SEMA, Note D.S., No.\u00a09, Paris."},{"issue":"3","key":"162_CR20","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/(SICI)1099-1425(199905\/06)2:3<115::AID-JOS20>3.0.CO;2-U","volume":"2","author":"S. Sethi","year":"1999","unstructured":"Sethi, S., Sriskandarajah, C., van\u00a0de Velde, S., Wang, M. Y., & Hoogeveen, H. (1999). Minimizing makespan in a pallet-constrained flowshop. Journal of Scheduling, 2(3), 115\u2013133.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"162_CR21","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(93)E0169-Y","volume":"59","author":"Y. N. Sotskov","year":"1995","unstructured":"Sotskov, Y. N., & Shakhlevich, N. V. (1995). NP-hardness of shop-scheduling problems with three jobs. Discrete Applied Mathematics, 59(3), 237\u2013266.","journal-title":"Discrete Applied Mathematics"},{"key":"162_CR22","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1080\/03155986.1997.11732335","volume":"35","author":"M. Y. Wang","year":"1997","unstructured":"Wang, M. Y., Sethi, S. P., Sriskandarajah, C., & van\u00a0de Velde, S. L. (1997). Minimizing makespan in a flowshop with pallet requirements: computational complexity. INFOR (Information Systems and Operational Research), 35, 277\u2013285.","journal-title":"INFOR (Information Systems and Operational Research)"},{"issue":"1","key":"162_CR23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"A. Warshall","year":"1963","unstructured":"Warshall, A. (1963). A theorem on Boolean matrices. Journal of the ACM, 9(1), 11\u201312.","journal-title":"Journal of the ACM"},{"key":"162_CR24","unstructured":"Wei, V. K. (1981). A lower bound on the stability number of a simple graph. Technical Memorandum No. 81-11217-9. Bell Laboratories."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0162-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0162-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0162-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T12:33:55Z","timestamp":1590582835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0162-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["162"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0162-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}