{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T10:36:20Z","timestamp":1770460580229,"version":"3.49.0"},"reference-count":40,"publisher":"Informa UK Limited","issue":"7","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the Operational Research Society"],"published-print":{"date-parts":[[2022,7,3]]},"DOI":"10.1080\/01605682.2021.1915191","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T07:40:40Z","timestamp":1624261240000},"page":"1499-1516","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling problems on a new setting of flexible flowshops: \u2113-Machine proportionate flowshops"],"prefix":"10.1080","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[{"name":"Faculty of Social Sciences and Humanities, Department of Economics and Business Administration, Ariel University","place":["Ariel, Israel"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[{"name":"Faculty of Natural Sciences, Computer Science, Ariel University","place":["Ariel, Israel"]}]}],"member":"301","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-016-1059-8"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940812"},{"key":"e_1_3_2_4_1","doi-asserted-by":"crossref","unstructured":"Cheng C. Y. Ying K. C. Chen H. H. & Lin J. X. (2018). Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities. Computers & Industrial Engineering 117 164\u2013170.","DOI":"10.1016\/j.cie.2018.01.027"},{"key":"e_1_3_2_5_1","doi-asserted-by":"crossref","unstructured":"Epstein L. & Zebedat-Haider H. (2016). Online scheduling of unit jobs on three machines with rejection: A tight result. Information Processing Letters 116(3) 252\u2013255.","DOI":"10.1016\/j.ipl.2015.11.012"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.12.004"},{"key":"e_1_3_2_7_1","unstructured":"Garey M. R. & Johnson D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman & Co."},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.09.004"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1456693"},{"key":"e_1_3_2_10_1","doi-asserted-by":"crossref","unstructured":"Gerstl E. Mor B. & Mosheiov G. (2017). Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times due-window and job rejection. Computers & Operations Research 83 150\u2013156.","DOI":"10.1016\/j.cor.2017.02.010"},{"key":"e_1_3_2_11_1","doi-asserted-by":"crossref","unstructured":"Gerstl E. & Mosheiov G. (2017). Single machine scheduling problems with generalised due-dates and job-rejection. International Journal of Production Research 55(11) 3164\u20133172.","DOI":"10.1080\/00207543.2016.1266055"},{"key":"e_1_3_2_12_1","doi-asserted-by":"crossref","unstructured":"Jiang C. Zou D. Bai D. & Wang J. B. (2019). Proportionate flowshop scheduling with position-dependent weights. Engineering Optimization.","DOI":"10.1080\/0305215X.2019.1573898"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1468097"},{"key":"e_1_3_2_15_1","doi-asserted-by":"crossref","unstructured":"Kovalyov M. Y. & Werner F. (2002). Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness. Journal of Heuristics 8(4) 415\u2013428.","DOI":"10.1023\/A:1015487829051"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.5267\/j.ijiec.2018.4.001"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595917500154"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(99)00023-6"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.9"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.09.023"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2014.112"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.03.037"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2779-1"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-020-00436-z"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-019-00612-y"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2018.1506540"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-020-1130-z"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2019.1621222"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2020.1735380"},{"key":"e_1_3_2_30_1","doi-asserted-by":"crossref","unstructured":"Mosheiov G. & Strusevich V. A. (2017). Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow. Naval Research Logistics (NRL) 64(3) 217\u2013224.","DOI":"10.1002\/nav.21740"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.019"},{"key":"e_1_3_2_32_1","doi-asserted-by":"crossref","unstructured":"Ou J. Zhong X. & Li C. L. (2016). Faster algorithms for single machine scheduling with release dates and rejection. Information Processing Letters 116(8) 503\u2013507.","DOI":"10.1016\/j.ipl.2016.02.008"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21615"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.03.013"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21518"},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3"},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-012-0303-z"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2015.95"},{"key":"e_1_3_2_39_1","unstructured":"Stein C. Uetz M. J. & Vredeveld T. (2009). Proceedings of 9th Workshop on Models and Algorithms for Planning and Scheduling Problems. Centre for Telematics and Information Technology."},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.09.018"},{"key":"e_1_3_2_41_1","doi-asserted-by":"crossref","unstructured":"Zhong X. Pan Z. & Jiang D. (2017). Scheduling with release times and rejection on two parallel machines. Journal of combinatorial Optimization 33(3) 934\u2013944.","DOI":"10.1007\/s10878-016-0016-x"}],"container-title":["Journal of the Operational Research Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01605682.2021.1915191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T16:57:53Z","timestamp":1770397073000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01605682.2021.1915191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":40,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7,3]]}},"alternative-id":["10.1080\/01605682.2021.1915191"],"URL":"https:\/\/doi.org\/10.1080\/01605682.2021.1915191","relation":{},"ISSN":["0160-5682","1476-9360"],"issn-type":[{"value":"0160-5682","type":"print"},{"value":"1476-9360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tjor20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-02-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-01","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}