{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:43:40Z","timestamp":1760708620933},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T00:00:00Z","timestamp":1379548800000},"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":[[2013,12]]},"DOI":"10.1007\/s10479-013-1446-9","type":"journal-article","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T07:56:27Z","timestamp":1379490987000},"page":"333-356","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling the two-machine open shop problem under resource constraints for setting the jobs"],"prefix":"10.1007","volume":"211","author":[{"given":"Ammar","family":"Oulamara","sequence":"first","affiliation":[]},{"given":"Djamal","family":"Rebaine","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Serairi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,19]]},"reference":[{"key":"1446_CR1","doi-asserted-by":"crossref","first-page":"3650","DOI":"10.1016\/j.tcs.2011.03.025","volume":"412","author":"E. Angelelli","year":"2011","unstructured":"Angelelli, E., & Filippi, C. (2011). On the complexity of interval scheduling with a resource constraint. Theoretical Computer Science, 412, 3650\u20133657.","journal-title":"Theoretical Computer Science"},{"key":"1446_CR2","first-page":"1","volume":"31","author":"J. Blazewicz","year":"1987","unstructured":"Blazewicz, J. (1987). Selected topics in scheduling theory. Annals of Discrete Mathematics, 31, 1\u201361.","journal-title":"Annals of Discrete Mathematics"},{"key":"1446_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1983). Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics, 5, 11\u201324.","journal-title":"Discrete Applied Mathematics"},{"key":"1446_CR4","unstructured":"Blazewicz, J., Cellary, W., Slowinski, R., & Weglarz, J. (1986). Scheduling under resource constraints\u2014deterministic models. Annals of Operations Research, 7."},{"key":"1446_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., Moehring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: notation, classification, models, and methods. European Journal of Operational Research, 112, 3\u201341.","journal-title":"European Journal of Operational Research"},{"key":"1446_CR6","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 flow-shop scheduling with setup and dismounting times. Computers & Operations Research, 26, 715\u2013730.","journal-title":"Computers & Operations Research"},{"key":"1446_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0166-218X(92)90245-6","volume":"35","author":"D. Werra De","year":"1992","unstructured":"De Werra, D., & Blazewicz, J. (1992). Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. Discrete Applied Mathematics, 35, 205\u2013219.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"1446_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(93)90172-K","volume":"43","author":"D. Werra De","year":"1993","unstructured":"De Werra, D., & Blazewicz, J. (1993). Addendum: some preemptive open shop scheduling problems with a renewable or a non renewable resource. Discrete Applied Mathematics, 43(1), 103\u2013104.","journal-title":"Discrete Applied Mathematics"},{"key":"1446_CR9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(91)90080-9","volume":"10","author":"D. Werra De","year":"1991","unstructured":"De Werra, D., Blazewicz, J., & Kubiak, W. (1991). A preemptive open shop scheduling problem with one resource. Operations Research Letters, 10, 9\u201315.","journal-title":"Operations Research Letters"},{"key":"1446_CR10","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.cie.2007.10.011","volume":"54","author":"E. Figielska","year":"2008","unstructured":"Figielska, E. (2008). A new heuristic for scheduling the two-stage flowshop with additional resources. Computers & Industrial Engineering, 54, 750\u2013763.","journal-title":"Computers & Industrial Engineering"},{"key":"1446_CR11","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cie.2010.06.006","volume":"59","author":"E. Figielska","year":"2010","unstructured":"Figielska, E. (2010). Heuristic algorithms for preemptive scheduling in a two-stage hybrid flowshop with additional renewable resources at each stage. Computers & Industrial Engineering, 59, 509\u2013519.","journal-title":"Computers & Industrial Engineering"},{"key":"1446_CR12","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. 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."},{"key":"1446_CR13","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"},{"issue":"4","key":"1446_CR14","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM, 23(4), 665\u2013679.","journal-title":"Journal of the ACM"},{"key":"1446_CR15","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., Lawler, E. L., Lenstra, J. K., & Rinnooy\u00a0Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"1446_CR16","unstructured":"Hall, N. G., Potts, C. N., & Sriskandarajah, C. (1994). Parallel machine scheduling with a common server. Working Paper Series WP 94-21, Max M. Fisher College of Business, The Ohio State University, Columbus, OH."},{"key":"1446_CR17","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/opre.45.4.544","volume":"45","author":"B. Jurisch","year":"1997","unstructured":"Jurisch, B., & Kubiak, W. (1997). Two-machine open shops with renewable resources. Operations Research, 45, 544\u2013552.","journal-title":"Operations Research"},{"key":"1446_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0377-2217(02)00246-1","volume":"147","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 Operational Research, 147, 345\u2013364.","journal-title":"European Journal of Operational Research"},{"key":"1446_CR19","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"},{"issue":"6","key":"1446_CR20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0167-6377(84)90074-9","volume":"2","author":"J. K. Lenstra","year":"1984","unstructured":"Lenstra, J. K., & Rinnooy Kan, A. H. G. (1984). New directions in scheduling theory. Operations Research Letters, 2(6), 255\u2013259.","journal-title":"Operations Research Letters"},{"key":"1446_CR21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-94-009-7801-0_9","volume-title":"Deterministic and stochastic scheduling","author":"M. Pinedo","year":"1982","unstructured":"Pinedo, M., & Schrage, L. (1982). Stochastic shop scheduling: a survey. In M. A. H. Dempster, E. H. Lawler, J. K. Lenstra, & A. H. G. Rinnooy Kan (Eds.), Deterministic and stochastic scheduling (pp. 181\u2013196). Dordrecht: Reidel."},{"issue":"2","key":"1446_CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF02684434","volume":"58","author":"T. Tautenhahn","year":"1997","unstructured":"Tautenhahn, T., & Woeginger, G. J. (1997). Unit-time scheduling problems with time dependent resources. Journal of Computing, 58(2), 97\u2013111.","journal-title":"Journal of Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1446-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1446-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1446-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:44Z","timestamp":1559138984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1446-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,19]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["1446"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1446-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,19]]}}}