{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:21:43Z","timestamp":1778343703885,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,9,12]],"date-time":"2009-09-12T00:00:00Z","timestamp":1252713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10951-009-0130-z","type":"journal-article","created":{"date-parts":[[2009,9,11]],"date-time":"2009-09-11T16:56:16Z","timestamp":1252688176000},"page":"3-16","source":"Crossref","is-referenced-by-count":9,"title":["Flow shops with WIP and value added costs"],"prefix":"10.1007","volume":"13","author":[{"given":"Jaehwan","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Posner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,12]]},"reference":[{"key":"130_CR1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(84)90016-9","volume":"11","author":"I. Adiri","year":"1984","unstructured":"Adiri, I., & Amit, N. (1984). Openshop and flowshop scheduling to minimize sum of completion times. Computers & Operations Research, 11, 275\u2013284.","journal-title":"Computers & Operations Research"},{"key":"130_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.36.2.229","volume":"36","author":"R. Conway","year":"1988","unstructured":"Conway, R., Maxwell, W., McClain, J. O., & Thomas, L. J. (1988). The role of work-in-process inventory in serial production lines. Operations Research, 36, 229\u2013241.","journal-title":"Operations Research"},{"key":"130_CR3","volume-title":"Theory of scheduling","author":"R. W. Conway","year":"1967","unstructured":"Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley."},{"key":"130_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","volume":"139","author":"F. D. Croce","year":"2002","unstructured":"Croce, F. D., Ghirardi, M., & Tadei, R. (2002). An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research, 139, 293\u2013301.","journal-title":"European Journal of Operational Research"},{"key":"130_CR5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","volume":"90","author":"F. D. Croce","year":"1996","unstructured":"Croce, F. D., Narayan, V., & Tadei, R. (1996). The two-machine total completion time flow shop problem. European Journal of Operational Research, 90, 227\u2013237.","journal-title":"European Journal of Operational Research"},{"key":"130_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. R. 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, 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"130_CR7","doi-asserted-by":"crossref","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 job shop schedules: complexity and approximation. Operations Research, 26, 36\u201352.","journal-title":"Operations Research"},{"key":"130_CR8","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 Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a\u00a0survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"130_CR9","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N. G. Hall","year":"1996","unstructured":"Hall, N. G., & Sriskandarahjah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510\u2013525.","journal-title":"Operations Research"},{"key":"130_CR10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0377-2217(91)90080-F","volume":"52","author":"J. C. Ho","year":"1991","unstructured":"Ho, J. C., & Chang, Y. L. (1991). A new heuristic for the n-job, m-machine flow-shop problem. European Journal of Operational Research, 52, 194\u2013202.","journal-title":"European Journal of Operational Research"},{"key":"130_CR11","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/0377-2217(93)E0353-Y","volume":"81","author":"J. C. Ho","year":"1995","unstructured":"Ho, J. C. (1995). Flowshop sequencing with mean flowtime objective. European Journal of Operational Research, 81, 571\u2013578.","journal-title":"European Journal of Operational Research"},{"key":"130_CR12","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1287\/moor.24.4.887","volume":"24","author":"J. A. Hoogeveen","year":"1999","unstructured":"Hoogeveen, J. A., & Kawaguchi, T. (1999). Minimizing total completion time in a two-machine flowshop: analysis of special cases. Mathematics of Operations Research, 24, 887\u2013910.","journal-title":"Mathematics of Operations Research"},{"key":"130_CR13","doi-asserted-by":"crossref","unstructured":"Hoogeveen, H., Schuurman, P., & Woeginger, G. J. (1998). Non-approximability results for scheduling problems with minsum criteria. In Proceedings of the 6th international IPCO conference on integer programming and combinatorial optimization (pp.\u00a0353\u2013366).","DOI":"10.1007\/3-540-69346-7_27"},{"key":"130_CR14","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/0377-2217(93)90247-K","volume":"70","author":"H. Kamoun","year":"1993","unstructured":"Kamoun, H., & Srikandarajah, C. (1993). The complexity of scheduling jobs in repetitive manufacturing systems. European Journal of Operational Research, 70, 350\u2013364.","journal-title":"European Journal of Operational Research"},{"key":"130_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"J. J. Kanet","year":"2000","unstructured":"Kanet, J. J., & Sridaharan, V. (2000). Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research, 48, 99\u2013110.","journal-title":"Operations Research"},{"key":"130_CR16","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1002\/1520-6750(199010)37:5<679::AID-NAV3220370507>3.0.CO;2-Q","volume":"37","author":"H. Matsuo","year":"1990","unstructured":"Matsuo, H. (1990). Cyclic sequencing problems in the two-machine permutation flow shop: complexity, worst-case, and average-case analysis. Naval Research Logistics, 37, 674\u2013694.","journal-title":"Naval Research Logistics"},{"key":"130_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/002077201300029746","volume":"32","author":"W.-C. Lee","year":"2001","unstructured":"Lee, W.-C., & Wu, C.-C. (2001). Minimizing the total flow time and tardiness in a two-machine flow shop. International Journal of Systems Science, 32, 365\u2013373.","journal-title":"International Journal of Systems Science"},{"key":"130_CR18","first-page":"1","volume":"28","author":"H. R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H. (1984). Some new results in no-wait flowshop scheduling. Zeitschrift F\u00fcr Operations Research, 28, 1\u201316.","journal-title":"Zeitschrift F\u00fcr Operations Research"},{"key":"130_CR19","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., & Woeginger, G. J. (1999). Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling, 2, 203\u2013213.","journal-title":"Journal of Scheduling"},{"key":"130_CR20","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1080\/00207548908942597","volume":"27","author":"D. Sipper","year":"1989","unstructured":"Sipper, D., & Shapira, R. (1989). JIT vs. WIP\u2014a trade-off analysis. International Journal of Production Research, 27, 903\u2013914.","journal-title":"International Journal of Production Research"},{"key":"130_CR21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF03500931","volume":"26","author":"S. L. Velde van de","year":"1992","unstructured":"van de Velde, S. L. (1992). 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":"130_CR22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0360-8352(93)90260-5","volume":"25","author":"V. S. Vempati","year":"1993","unstructured":"Vempati, V. S., Chen, C.-L., & Bullington, S. F. (1993). An effective heuristic for flow shop problems with total flow time as criterion. Computers and Industrial Engineering, 25, 219\u2013222.","journal-title":"Computers and Industrial Engineering"},{"key":"130_CR23","volume-title":"Manufacturing planning and control systems","author":"T. E. Vollman","year":"1997","unstructured":"Vollman, T. E., Berry, W. L., & Whybark, D. C. (1997). Manufacturing planning and control systems. New York: McGraw-Hill."},{"key":"130_CR24","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0925-5273(96)00060-6","volume":"44","author":"C. Wang","year":"1996","unstructured":"Wang, C., Chu, C., & Proth, J.-M. (1996). Efficient heuristic and optimal approaches for n\/2\/F\/\u2211C i scheduling problems. International Journal of Production Economics, 44, 225\u2013237.","journal-title":"International Journal of Production Economics"}],"updated-by":[{"DOI":"10.1007\/s10951-015-0420-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2015,2,15]],"date-time":"2015-02-15T00:00:00Z","timestamp":1423958400000}}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0130-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0130-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0130-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T04:06:30Z","timestamp":1590120390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0130-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,12]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["130"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0130-z","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10951-015-0420-6","asserted-by":"object"}]},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,12]]}}}