{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:58Z","timestamp":1740103858770,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100011512","name":"national research foundation","doi-asserted-by":"publisher","award":["NRF-2019R1A2C1004789"],"award-info":[{"award-number":["NRF-2019R1A2C1004789"]}],"id":[{"id":"10.13039\/100011512","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10951-023-00781-x","type":"journal-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T09:02:56Z","timestamp":1685523776000},"page":"61-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits"],"prefix":"10.1007","volume":"27","author":[{"given":"Xiaojuan","family":"Jiang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3526-9865","authenticated-orcid":false,"given":"Kangbok","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Michael L.","family":"Pinedo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"issue":"2","key":"781_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0377-2217(02)00253-9","volume":"147","author":"A Allahverdi","year":"2003","unstructured":"Allahverdi, A. (2003). The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. European Journal of Operational Research, 147(2), 373\u2013396.","journal-title":"European Journal of Operational Research"},{"key":"781_CR2","unstructured":"Aslam, J., Rasala, A., Stein, C., & Young, N. (1999). Improved bicriteria existence theorems for scheduling. In Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, society for industrial and applied mathematics (pp. 846\u2013847)."},{"key":"781_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Phillips, C. A., Schulz, A. S., Shmoys, D. B., Stein, C., & Wein, J. (1996). Improved scheduling algorithms for minsum criteria. In International colloquium on automata, languages, and programming (pp. 646\u2013657). Springer.","DOI":"10.1007\/3-540-61440-0_166"},{"issue":"1","key":"781_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/S0097539797327180","volume":"31","author":"C Chekuri","year":"2001","unstructured":"Chekuri, C., Motwani, R., Natarajan, B., & Stein, C. (2001). Approximation techniques for average completion time scheduling. SIAM Journal on Computing, 31(1), 146\u2013166.","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"781_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1287\/opre.44.6.891","volume":"44","author":"B Chen","year":"1996","unstructured":"Chen, B., Glass, C. A., Potts, C. N., & Strusevich, V. A. (1996). A new heuristic for three-machine flow shop scheduling. Operations Research, 44(6), 891\u2013898.","journal-title":"Operations Research"},{"issue":"1","key":"781_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2012.10.048","volume":"226","author":"DY Chung","year":"2013","unstructured":"Chung, D. Y., & Choi, B. C. (2013). Outsourcing and scheduling for two-machine ordered flow shop scheduling problems. European Journal of Operational Research, 226(1), 46\u201352.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"781_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00236-003-0119-6","volume":"39","author":"EG Coffman","year":"2003","unstructured":"Coffman, E. G., Sethuraman, J., & Timkovsky, V. G. (2003). Ideal preemptive schedules on two processors. Acta Informatica, 39(8), 597\u2013612.","journal-title":"Acta Informatica"},{"key":"781_CR8","volume-title":"Flow shop scheduling: Theoretical results, algorithms, and applications","author":"H Emmons","year":"2012","unstructured":"Emmons, H., & Vairaktarakis, G. (2012). Flow shop scheduling: Theoretical results, algorithms, and applications (Vol. 182). Springer."},{"issue":"3","key":"781_CR9","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas, V., Ruiz, R., & Framinan, J. M. (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. European Journal of Operational Research, 257(3), 707\u2013721.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"781_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"781_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/opre.26.1.36","volume":"26","author":"T Gonzalez","year":"1978","unstructured":"Gonzalez, T., & Sahni, S. (1978). Flowshop and jobshop schedules: Complexity and approximation. Operations Research, 26(1), 36\u201352.","journal-title":"Operations Research"},{"key":"781_CR12","doi-asserted-by":"crossref","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy\u00a0Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of discrete mathematics (Vol.\u00a05, pp. 287\u2013326). Elsevier.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"3","key":"781_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0925-5273(00)00039-6","volume":"69","author":"JN Gupta","year":"2001","unstructured":"Gupta, J. N., Neppalli, V. R., & Werner, F. (2001). Minimizing total flow time in a two-machine flowshop problem with minimum makespan. International Journal of Production Economics, 69(3), 323\u2013338.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"781_CR14","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operational Research, 167(3), 592\u2013623.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"781_CR15","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1287\/moor.24.4.887","volume":"24","author":"J Hoogeveen","year":"1999","unstructured":"Hoogeveen, J., & Kawaguchi, T. (1999). Minimizing total completion time in a two-machine flowshop: Analysis of special cases. Mathematics of Operations Research, 24(4), 887\u2013910.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"781_CR16","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2020.08.010","volume":"290","author":"X Jiang","year":"2021","unstructured":"Jiang, X., Lee, K., & Pinedo, M. L. (2021). Ideal schedules in parallel machine settings. European Journal of Operational Research, 290(2), 422\u2013434.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"781_CR17","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.ejor.2022.06.021","volume":"305","author":"X Jiang","year":"2023","unstructured":"Jiang, X., Lee, K., & Pinedo, M. L. (2023). Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time. European Journal of Operational Research, 305(2), 594\u2013607.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"781_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"781_CR19","doi-asserted-by":"crossref","unstructured":"Lee, K., & Pinedo, M. L. (2017). Chapter 5 Scheduling in manufacturing and services. In The Routledge companion to production and operations management (pp. 82\u2013100). Routledge.","DOI":"10.4324\/9781315687803-5"},{"issue":"1","key":"781_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ejor.2018.06.008","volume":"272","author":"K Lee","year":"2019","unstructured":"Lee, K., Zheng, F., & Pinedo, M. L. (2019). Online scheduling of ordered flow shops. European Journal of Operational Research, 272(1), 50\u201360.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"781_CR21","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.ijpe.2007.06.007","volume":"112","author":"BMT Lin","year":"2008","unstructured":"Lin, B. M. T., Lu, C., Shyu, S., & Tsai, C. (2008). Development of new features of ant colony optimization for flowshop scheduling. International Journal of Production Economics, 112(2), 742\u2013755.","journal-title":"International Journal of Production Economics"},{"key":"781_CR22","doi-asserted-by":"crossref","unstructured":"Lin, B. M. T., & Wu, J. (2006). Bicriteria scheduling in a two-machine permutation flowshop. International Journal of Production Research, 44(12), 2299\u20132312.","DOI":"10.1080\/00207540500446394"},{"issue":"3","key":"781_CR23","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1287\/ijoc.1070.0258","volume":"20","author":"G Minella","year":"2008","unstructured":"Minella, G., Ruiz, R., & Ciavotta, M. (2008). A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing, 20(3), 451\u2013471.","journal-title":"INFORMS Journal on Computing"},{"key":"781_CR24","doi-asserted-by":"crossref","unstructured":"Minella, G., Ruiz, R., & Ciavotta, M. (2011). Restarted iterated pareto greedy algorithm for multi-objective flowshop scheduling problems. Computers & Operations Research, 38(11), 1521\u20131533.","DOI":"10.1016\/j.cor.2011.01.010"},{"key":"781_CR25","doi-asserted-by":"crossref","unstructured":"Panwalkar, S., & Khan, A. (1976). An ordered flow-shop sequencing problem with mean completion time criterion. The International Journal of Production Research, 14(5), 631\u2013635.","DOI":"10.1080\/00207547608956381"},{"key":"781_CR26","doi-asserted-by":"crossref","unstructured":"Panwalkar, S., & Koulamas, C. (2012). An $$O (n^2)$$ algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines. European Journal of Operational Research, 221(1), 7\u201313.","DOI":"10.1016\/j.ejor.2012.02.020"},{"issue":"1","key":"781_CR27","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-019-00618-6","volume":"23","author":"S Panwalkar","year":"2020","unstructured":"Panwalkar, S., & Koulamas, C. (2020). Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines. Journal of Scheduling, 23(1), 145\u2013154.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"781_CR28","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/nav.21518","volume":"60","author":"S Panwalkar","year":"2013","unstructured":"Panwalkar, S., Smith, M. L., & Koulamas, C. (2013). Review of the ordered and proportionate flow shop scheduling research. Naval Research Logistics, 60(1), 46\u201355.","journal-title":"Naval Research Logistics"},{"key":"781_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems (5th ed.). Springer.","edition":"5"},{"issue":"9","key":"781_CR30","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1057\/jors.1992.126","volume":"43","author":"C Rajendran","year":"1993","unstructured":"Rajendran, C. (1993). Two-stage flowshop scheduling problem with bicriteria. Journal of the Operational Research Society, 43(9), 871\u2013884.","journal-title":"Journal of the Operational Research Society"},{"key":"781_CR31","unstructured":"Sarin, S., & Eybl, D. (1978). The two-machine mean-flowtime flowshop problem and some special cases. November. Talk at ORSA\/TIMS."},{"issue":"2","key":"781_CR32","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0377-2217(98)00009-5","volume":"113","author":"S Sayin","year":"1999","unstructured":"Sayin, S., & Karabati, S. (1999). Theory and methodology a bicriteria approach to the two-machine flow shop scheduling problem. European Journal of Operational Research, 113(2), 435\u2013449.","journal-title":"European Journal of Operational Research"},{"key":"781_CR33","unstructured":"Smith, M. L. (1968). A critical analysis of flow-shop sequencing. PhD thesis, Texas Tech University."},{"issue":"5","key":"781_CR34","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.21.5.544","volume":"21","author":"M Smith","year":"1975","unstructured":"Smith, M., Panwalkar, S., & Dudek, R. (1975). Flowshop sequencing problem with ordered processing time matrices. Management Science, 21(5), 544\u2013549.","journal-title":"Management Science"},{"issue":"3","key":"781_CR35","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/nav.3800230310","volume":"23","author":"M Smith","year":"1976","unstructured":"Smith, M., Panwalkar, S., & Dudek, R. (1976). Flowshop sequencing problem with ordered processing time matrices: A general case. Naval Research Logistics Quarterly, 23(3), 481\u2013486.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"781_CR36","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0167-6377(97)00025-4","volume":"21","author":"C Stein","year":"1997","unstructured":"Stein, C., & Wein, J. (1997). On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21(3), 115\u2013122.","journal-title":"Operations Research Letters"},{"key":"781_CR37","unstructured":"T\u2019kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling: Theory, models and algorithms. Springer."},{"issue":"4","key":"781_CR38","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0305-0548(02)00021-7","volume":"30","author":"V T\u2019kindt","year":"2003","unstructured":"T\u2019kindt, V., Gupta, J. N., & Billaut, J. C. (2003). Two-machine flowshop scheduling with a secondary criterion. Computers & Operations Research, 30(4), 505\u2013526.","journal-title":"Computers & Operations Research"},{"key":"781_CR39","unstructured":"Torng, E., & Uthaisombut, P. (1999). Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling. In Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms (Vol.\u00a017, pp. 973\u2013974)."},{"key":"781_CR40","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF03500931","volume":"26","author":"S van de Velde","year":"1990","unstructured":"van de Velde, S. (1990). Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation. Annals of Operations Research, 26, 257\u2013268.","journal-title":"Annals of Operations Research"},{"key":"781_CR41","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","volume":"45","author":"MM Yenisey","year":"2014","unstructured":"Yenisey, M. M., & Yagmahan, B. (2014). Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends. Omega, 45, 119\u2013135.","journal-title":"Omega"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00781-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00781-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00781-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T13:13:01Z","timestamp":1707657181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00781-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,31]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["781"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00781-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2023,5,31]]},"assertion":[{"value":"20 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}