{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T19:22:47Z","timestamp":1720466567570},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,21]],"date-time":"2012-11-21T00:00:00Z","timestamp":1353456000000},"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,7]]},"DOI":"10.1007\/s10479-012-1256-5","type":"journal-article","created":{"date-parts":[[2012,11,22]],"date-time":"2012-11-22T18:18:40Z","timestamp":1353608320000},"page":"311-339","source":"Crossref","is-referenced-by-count":7,"title":["Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)"],"prefix":"10.1007","volume":"206","author":[{"given":"Gaby","family":"Pinto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yariv T.","family":"Ben-Dov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad","family":"Rabinowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,21]]},"reference":[{"key":"1256_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(95)00114-7","volume":"72","author":"A. Agnetis","year":"1997","unstructured":"Agnetis, A., Pacciarelli, D., & Rossi, F. (1997). Batch scheduling in a two-machine flow shop with limited buffer. Discrete Applied Mathematics, 72, 243\u2013260.","journal-title":"Discrete Applied Mathematics"},{"key":"1256_CR2","volume-title":"Proceedings of the 4th IEEE international conference on computational cybernetic (ICCC)","author":"I. Ainbinder","year":"2006","unstructured":"Ainbinder, I., Pinto, G., Rabinowitz, G., & Ben-Dov, Y. T. (2006). A customized branch and bound algorithm to solve a resource-sharing and scheduling problem. In Proceedings of the 4th IEEE international conference on computational cybernetic (ICCC), Estonia."},{"key":"1256_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C. Artigues","year":"2008","unstructured":"Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159, 135\u2013159.","journal-title":"Annals of Operations Research"},{"issue":"10","key":"1256_CR4","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1080\/00207540050028034","volume":"38","author":"M. Azizoglu","year":"2000","unstructured":"Azizoglu, M., & Webster, S. (2000). Scheduling a batch processing machine with non-identical job sizes. International Journal of Production Research, 38(10), 2173\u20132184.","journal-title":"International Journal of Production Research"},{"key":"1256_CR5","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/S0016-3287(03)00026-0","volume":"35","author":"N. Bostrom","year":"2003","unstructured":"Bostrom, N. (2003). When machines outsmart humans. Futures, 35, 759\u2013764.","journal-title":"Futures"},{"key":"1256_CR6","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., M\u00f6hring, 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":"1256_CR7","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Knust, S., Schoo, A., & Thiele, O. (1998). A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 107, 272\u2013288.","journal-title":"European Journal of Operational Research"},{"key":"1256_CR8","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1007\/s00170-005-0017-x","volume":"29","author":"J. S. Chen","year":"2006","unstructured":"Chen, J. S. (2006). A branch and bound procedure for the reentrant permutation flow-shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 29, 1186\u20131193.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"1256_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10951-005-6365-4","volume":"8","author":"H. A. J. Crauwels","year":"2005","unstructured":"Crauwels, H. A. J., Potts, C. N., Van Oudheusden, D., & Van Wassenhove, L. N. (2005). Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs. Journal of Scheduling, 8, 161\u2013177.","journal-title":"Journal of Scheduling"},{"key":"1256_CR10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ijpe.2004.07.006","volume":"97","author":"S. R. Das","year":"2005","unstructured":"Das, S. R., & Canel, C. (2005). An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing. International Journal of Production Economics, 97, 247\u2013262.","journal-title":"International Journal of Production Economics"},{"key":"1256_CR11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10951-005-2861-9","volume":"8","author":"M. Dawande","year":"2005","unstructured":"Dawande, M., Geismar, H. N., Sethi, S. P., & Sriskandarajah, C. (2005). Sequencing and scheduling in robotic cells: recent developments. Journal of Scheduling, 8, 387\u2013426.","journal-title":"Journal of Scheduling"},{"key":"1256_CR12","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1287\/mnsc.46.10.1365.12272","volume":"46","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., & Phan Huy, T. (2000). A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints. Management Science, 46, 1365\u20131384.","journal-title":"Management Science"},{"key":"1256_CR13","unstructured":"D\u00fcmmler, M. (2004). Modeling and optimization of cluster tools in semiconductor manufacturing. PhD thesis, Department of Computer Science. University of W\u00fcrzburg, Germany."},{"key":"1256_CR14","volume-title":"Activity network: project planning and control by network models","author":"S. E. Elmaghraby","year":"1977","unstructured":"Elmaghraby, S. E. (1977). Activity network: project planning and control by network models. New York: Wiley."},{"issue":"4","key":"1256_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0272-6963(83)90004-9","volume":"3","author":"S. C. Graves","year":"1983","unstructured":"Graves, S. C., Meal, H. C., Stefek, D., & Zeeghmi, A. H. (1983). Scheduling of re-entrant flow shops. Journal of Operations Management, 3(4), 197\u2013207.","journal-title":"Journal of Operations Management"},{"key":"1256_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018976827443","volume":"69","author":"J. N. D. Gupta","year":"1997","unstructured":"Gupta, J. N. D., Hariri, A. M. A., & Potts, C. N. (1997). Scheduling a two stage hybrid shop with parallel machines at the first stage. Annals of Operations Research, 69, 171\u2013191.","journal-title":"Annals of Operations Research"},{"key":"1256_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S. Hartmann","year":"2010","unstructured":"Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207, 1\u201314.","journal-title":"European Journal of Operational Research"},{"key":"1256_CR18","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<283::AID-NET5>3.0.CO;2-I","volume":"32","author":"S. Hartmann","year":"1998","unstructured":"Hartmann, S., & Drexl, A. (1998). Project scheduling with multiple modes: a comparison of exact algorithms. Networks, 32, 283\u2013297.","journal-title":"Networks"},{"issue":"3","key":"1256_CR19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10601-006-8060-2","volume":"11","author":"J. N. Hooker","year":"2006","unstructured":"Hooker, J. N. (2006). An integrated method for planning and scheduling to minimize tardiness. Constraints, 11(3), 139\u2013157.","journal-title":"Constraints"},{"issue":"2","key":"1256_CR20","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/TSM.2006.873402","volume":"19","author":"L. Hwan-Yong","year":"2006","unstructured":"Hwan-Yong, L., & Tae-Eog, L. (2006). Scheduling single-armed cluster tools with reentrant wafer flows. IEEE Transactions on Semiconductor Manufacturing, 19(2), 226\u2013240.","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"issue":"4","key":"1256_CR21","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N. (1984). A new polynomial time algorithm for linear programming. Combinatorica, 4(4), 373\u2013395.","journal-title":"Combinatorica"},{"key":"1256_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problem","author":"H. Kellere","year":"2004","unstructured":"Kellere, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problem. Berlin: Springer."},{"key":"1256_CR23","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1057\/jors.2009.182","volume":"62","author":"S. W. Lin","year":"2011","unstructured":"Lin, S. W., Lee, Z. J., Ying, K. C., & Lin, R. H. (2011). Meta-heuristic algorithms for wafer sorting scheduling problems. Journal of the Operational Research Society, 62, 165\u2013174.","journal-title":"Journal of the Operational Research Society"},{"key":"1256_CR24","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1115\/1.3140740","volume":"107","author":"O. Z. Maimon","year":"1985","unstructured":"Maimon, O. Z., & Nof, S. Y. (1985). Coordination of robots sharing assembly tasks. Journal of Dynamic Systems, Measurement, and Control, 107, 299\u2013307.","journal-title":"Journal of Dynamic Systems, Measurement, and Control"},{"key":"1256_CR25","first-page":"165","volume":"30","author":"S. V. Mehta","year":"1998","unstructured":"Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30, 165\u2013178.","journal-title":"IIE Transactions"},{"issue":"1","key":"1256_CR26","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.cor.2007.07.001","volume":"36","author":"J. J. M. Mendes","year":"2009","unstructured":"Mendes, J. J. M., Goncalves, J. F., & Resende, M. G. C. (2009). A random key based genetic algorithm for the resource constrained project scheduling problem. Computers & Operations Research, 36(1), 92\u2013109.","journal-title":"Computers & Operations Research"},{"key":"1256_CR27","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., & Bianco, L. (1998). An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Science, 44, 714\u2013772.","journal-title":"Management Science"},{"issue":"6","key":"1256_CR28","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L. Monch","year":"2011","unstructured":"Monch, L., Fowler, J. W., Dauzere-Peres, S., Mason, S. J., & Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583\u2013599.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"1256_CR29","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TSM.2008.2000425","volume":"21","author":"W. Naiqi","year":"2008","unstructured":"Naiqi, W., Chengbin, C., Feng, C., & Meng, C. Z. (2008). A Petri net method for schedulability and scheduling problems in single-arm cluster tools with wafer residency time constraints. IEEE Transactions on Semiconductor Manufacturing, 21(2), 224\u2013237.","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"1256_CR30","author":"A. Obeid","year":"2012","unstructured":"Obeid, A., Dauzere-Peres, S., & Yugma, C. (2012). Scheduling job families on non-identical parallel machines with time constraints. Annals of Operations Research. doi: 10.1007\/s10479-012-1107-4 .","journal-title":"Annals of Operations Research"},{"key":"1256_CR31","volume-title":"Advances in project scheduling","author":"J. H. Patterson","year":"1989","unstructured":"Patterson, J. H., Sowinski, R., Talbot, F. B., & Weglarz, J. (1989). An algorithm for a general class of precedence and resource-constrained scheduling problems. In R. Sowinski & J. Weglarz (Eds.), Advances in project scheduling, Amsterdam: Elsevier."},{"key":"1256_CR32","volume-title":"Scheduling theory, algorithms and systems","author":"M. Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling theory, algorithms and systems (3rd ed.). New York: Springer.","edition":"3"},{"key":"1256_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-0910-7","volume-title":"Planning and scheduling in manufacturing and services","author":"M. Pinedo","year":"2009","unstructured":"Pinedo, M. (2009). Planning and scheduling in manufacturing and services (2nd ed.). New York: Springer.","edition":"2"},{"key":"1256_CR34","unstructured":"Pinto, G. (2009). Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP). PhD thesis, Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel."},{"issue":"3","key":"1256_CR35","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1016\/j.cie.2009.05.003","volume":"57","author":"G. Pinto","year":"2009","unstructured":"Pinto, G., Ainbinder, I., & Rabinowitz, G. (2009). A genetic algorithm-based approach for solving the resource sharing and scheduling problem. Computers & Industrial Engineering, 57(3), 1131\u20131143.","journal-title":"Computers & Industrial Engineering"},{"key":"1256_CR36","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., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"1256_CR37","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF00167515","volume":"3","author":"G. Rabinowitz","year":"1991","unstructured":"Rabinowitz, G., Mehrez, A., & Samaddar, S. (1991). Scheduling model for multi-robot assembly cells. International Journal of Flexible Manufacturing Systems, 3, 149\u2013180.","journal-title":"International Journal of Flexible Manufacturing Systems"},{"key":"1256_CR38","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0925-5273(01)00105-0","volume":"74","author":"F. Riane","year":"2001","unstructured":"Riane, F., Artiba, A., & Iassinovski, S. (2001). An integrated production planning and scheduling system for hybrid flowshop organizations. International Journal of Production Economics, 74, 33\u201348.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"1256_CR39","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s11227-007-0158-9","volume":"44","author":"M. Sabzehparvar","year":"2008","unstructured":"Sabzehparvar, M. (2008). A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags. Journal of Supercomputing, 44(3), 257\u2013273.","journal-title":"Journal of Supercomputing"},{"issue":"3","key":"1256_CR40","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., Rabinowitz, G., & Mehrez, A. (1999). Resource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell. Computers & Industrial Engineering, 36(3), 525\u2013547.","journal-title":"Computers & Industrial Engineering"},{"key":"1256_CR41","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.ejor.2003.12.020","volume":"165","author":"S. Samaddar","year":"2005","unstructured":"Samaddar, S., Rabinowitz, G., & Zhang, G. P. (2005). An experimental analysis of solution performance in a resource sharing and scheduling problem. European Journal of Operational Research, 165, 139\u2013156.","journal-title":"European Journal of Operational Research"},{"key":"1256_CR42","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0377-2217(01)00328-9","volume":"143","author":"T. Sawik","year":"2002","unstructured":"Sawik, T. (2002). Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line. European Journal of Operational Research, 143, 115\u2013124.","journal-title":"European Journal of Operational Research"},{"key":"1256_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00795-6","volume":"154","author":"T. Sawik","year":"2004","unstructured":"Sawik, T. (2004). Loading and scheduling of a flexible assembly system by mixed integer programming. European Journal of Operational Research, 154, 1\u201319.","journal-title":"European Journal of Operational Research"},{"key":"1256_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03830-7","volume-title":"Hierarchies in distributed decision making","author":"C. Schneeweiss","year":"1999","unstructured":"Schneeweiss, C. (1999). Hierarchies in distributed decision making. Berlin: Springer."},{"key":"1256_CR45","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0377-2217(97)00433-5","volume":"113","author":"K. Shanker","year":"1999","unstructured":"Shanker, K., & Modi, B. K. (1999). A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment. European Journal of Operational Research, 113, 80\u201390.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1256_CR46","first-page":"318","volume":"124","author":"H. D. Sherali","year":"2000","unstructured":"Sherali, H. D., & Driscoll, P. J. (2000). Evolution and state-of-the-art in integer programming. Journal of Computational and Applied Mathematics, 124(1), 318\u2013340.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"1256_CR47","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1287\/mnsc.45.3.452","volume":"45","author":"A. Sprecher","year":"1999","unstructured":"Sprecher, A., & Drexl, A. (1999). Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling. Management Science, 45, 452\u2013454.","journal-title":"Management Science"},{"issue":"4","key":"1256_CR48","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/TEVC.2008.2011991","volume":"13","author":"L. Y. Tseng","year":"2009","unstructured":"Tseng, L. Y., & Chen, S. C. (2009). Two-phase genetic local search algorithm for the multimode resource-constrained project scheduling problem. IEEE Transactions on Evolutionary Computation, 13(4), 848\u2013857.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1256_CR49","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2010.03.037","volume":"208","author":"J. Weglarz","year":"2011","unstructured":"Weglarz, J., Jozefowska, J., Mika, M., & Waligora, G. (2011). Project scheduling with finite or infinite number of activity processing modes\u2014a survey. European Journal of Operational Research, 208, 177\u2013205.","journal-title":"European Journal of Operational Research"},{"key":"1256_CR50","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1080\/07408170701748877","volume":"40","author":"M. Yazid","year":"2008","unstructured":"Yazid, M., & Xiaolan, X. (2008). A genetic-search-guided greedy algorithm for multi-resource shop scheduling with flexibility. IIE Transactions, 40, 1228\u20131240.","journal-title":"IIE Transactions"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1256-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1256-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1256-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:38Z","timestamp":1559153378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1256-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,21]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1256"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1256-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,21]]}}}