[{"volume":25,"user_id":"51811","_id":"53247","publisher":"Springer Science and Business Media LLC","page":"589-621","status":"public","citation":{"apa":"Shahvari, O., Logendran, R., &#38; Tavana, M. (2022). An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems. <i>Journal of Scheduling</i>, <i>25</i>(5), 589–621. <a href=\"https://doi.org/10.1007/s10951-022-00729-7\">https://doi.org/10.1007/s10951-022-00729-7</a>","ieee":"O. Shahvari, R. Logendran, and M. Tavana, “An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems,” <i>Journal of Scheduling</i>, vol. 25, no. 5, pp. 589–621, 2022, doi: <a href=\"https://doi.org/10.1007/s10951-022-00729-7\">10.1007/s10951-022-00729-7</a>.","short":"O. Shahvari, R. Logendran, M. Tavana, Journal of Scheduling 25 (2022) 589–621.","chicago":"Shahvari, Omid, Rasaratnam Logendran, and Madjid Tavana. “An Efficient Model-Based Branch-and-Price Algorithm for Unrelated-Parallel Machine Batching and Scheduling Problems.” <i>Journal of Scheduling</i> 25, no. 5 (2022): 589–621. <a href=\"https://doi.org/10.1007/s10951-022-00729-7\">https://doi.org/10.1007/s10951-022-00729-7</a>.","mla":"Shahvari, Omid, et al. “An Efficient Model-Based Branch-and-Price Algorithm for Unrelated-Parallel Machine Batching and Scheduling Problems.” <i>Journal of Scheduling</i>, vol. 25, no. 5, Springer Science and Business Media LLC, 2022, pp. 589–621, doi:<a href=\"https://doi.org/10.1007/s10951-022-00729-7\">10.1007/s10951-022-00729-7</a>.","ama":"Shahvari O, Logendran R, Tavana M. An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems. <i>Journal of Scheduling</i>. 2022;25(5):589-621. doi:<a href=\"https://doi.org/10.1007/s10951-022-00729-7\">10.1007/s10951-022-00729-7</a>","bibtex":"@article{Shahvari_Logendran_Tavana_2022, title={An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems}, volume={25}, DOI={<a href=\"https://doi.org/10.1007/s10951-022-00729-7\">10.1007/s10951-022-00729-7</a>}, number={5}, journal={Journal of Scheduling}, publisher={Springer Science and Business Media LLC}, author={Shahvari, Omid and Logendran, Rasaratnam and Tavana, Madjid}, year={2022}, pages={589–621} }"},"doi":"10.1007/s10951-022-00729-7","language":[{"iso":"eng"}],"intvolume":"        25","publication_status":"published","date_updated":"2024-04-15T13:18:46Z","author":[{"first_name":"Omid","last_name":"Shahvari","full_name":"Shahvari, Omid"},{"full_name":"Logendran, Rasaratnam","last_name":"Logendran","first_name":"Rasaratnam"},{"last_name":"Tavana","first_name":"Madjid","full_name":"Tavana, Madjid","id":"31858"}],"publication_identifier":{"issn":["1094-6136","1099-1425"]},"title":"An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems","year":"2022","department":[{"_id":"277"}],"type":"journal_article","date_created":"2024-04-04T15:56:31Z","issue":"5","publication":"Journal of Scheduling"}]