{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:19:52Z","timestamp":1770970792045,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1023\/a:1024042209719","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T21:07:28Z","timestamp":1063400848000},"page":"339-354","source":"Crossref","is-referenced-by-count":37,"title":["Scheduling and Lot Streaming in Flowshops with No-Wait in Process"],"prefix":"10.1007","volume":"6","author":[{"given":"Nicholas G.","family":"Hall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esaignani","family":"Selvarajah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chelliah","family":"Sriskandarajah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5124575_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/opre.48.1.177.12451","volume":"48","author":"I. N. K. Abadi","year":"2000","unstructured":"Abadi, I. N. K., N. G. Hall, and C. Sriskandarajah, \u201cMinimizing cycle time in a blocking flowshop,\u201d Oper. Res., 48, 177-180 (2000).","journal-title":"Oper. Res."},{"key":"5124575_CR2","volume-title":"Introduction to Sequencing and Scheduling","author":"K. R. Baker","year":"1974","unstructured":"Baker, K. R., Introduction to Sequencing and Scheduling, Addison-Wesley, Reading, MA, 1974."},{"key":"5124575_CR3","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1111\/j.1540-5915.1990.tb00328.x","volume":"21","author":"K. R. Baker","year":"1990","unstructured":"Baker, K. R., \u201cSolution procedures for the lot-streaming problem,\u201d Decision Sci., 21, 475-491 (1990).","journal-title":"Decision Sci."},{"key":"5124575_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02099687","volume":"57","author":"K. R. Baker","year":"1995","unstructured":"Baker, K. R., \u201cLot streaming in the two machine flow shop with setup times,\u201d Ann. Oper. Res., 57, 1-11 (1995).","journal-title":"Ann. Oper. Res."},{"key":"5124575_CR5","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","volume":"26","author":"G. Carpaneto","year":"1980","unstructured":"Carpaneto, G. and P. Toth, \u201cSome new branching and bounding criteria for the asymmetric traveling salesman problem,\u201d Manage. Sci., 26, 736-743 (1980).","journal-title":"Manage. Sci."},{"key":"5124575_CR6","volume-title":"A degree relaxation algorithm for the asymmetric generalized traveling salesman problem","author":"M. Gendreau","year":"1991","unstructured":"Gendreau, M., and G. Laporte, D. Simchi-Levi, \u201cA degree relaxation algorithm for the asymmetric generalized traveling salesman problem,\u201d Publication CRT-800, Centre for Research on Transportation, Montreal, 1991."},{"key":"5124575_CR7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P. C. Gilmore","year":"1964","unstructured":"Gilmore, P. C. and R. E. Gomory, \u201cSequencing a one-state variable machine: A solvable case of the travelling salesman problem,\u201d Oper. Res., 12, 665-679 (1964).","journal-title":"Oper. Res."},{"key":"5124575_CR8","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/0377-2217(94)90082-5","volume":"75","author":"C. A. Glass","year":"1994","unstructured":"Glass, C. A., J. N. D. Gupta, C. N. Potts, \u201cLot streaming in three-stage process,\u201d Eur. J. Oper. Res., 75, 378-394 (1994).","journal-title":"Eur. J. Oper. Res."},{"key":"5124575_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna, Tabu Search, Kluwer, Boston, 1997."},{"key":"5124575_CR10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T. and S. Sahni, \u201cOpenshop scheduling to minimize finish time,\u201d J. Assoc. Comput. Mach., 23, 665-679 (1976).","journal-title":"J. Assoc. Comput. Mach."},{"key":"5124575_CR11","first-page":"220","volume":"25","author":"S. K. Goyal","year":"1988","unstructured":"Goyal, S. K. and C. Sriskandarajah, \u201cNo-wait shop scheduling: Computational complexity and approximate algorithms,\u201d Opsearch, 25, 220-244 (1988).","journal-title":"Opsearch"},{"key":"5124575_CR12","volume-title":"Scheduling and lot streaming in openshops with no-wait in process","author":"N. G. Hall","year":"2002","unstructured":"Hall, N. G., G. Laporte, E. Selvarajah, C. Sriskandarajah, \u201cScheduling and lot streaming in openshops with no-wait in process,\u201d Working Paper, Fisher College of Business, The Ohio State University, Columbus, Ohio, submitted for publication, December, 2002."},{"key":"5124575_CR13","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. and C. Sriskandarajah, \u201cA survey of machine scheduling problems with blocking and no-wait in process,\u201d Oper. Res., 44, 510-525 (1996).","journal-title":"Oper. Res."},{"key":"5124575_CR14","volume-title":"Anodize load scheduling for diamond aluminum","author":"E. Hsu","year":"1991","unstructured":"Hsu, E. and M. Stein, \u201cAnodize load scheduling for diamond aluminum,\u201d Undergraduate Thesis, Department of Industrial Engineering, University of Toronto, Canada, 1991."},{"key":"5124575_CR15","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","volume":"8","author":"R. M. Karp","year":"1979","unstructured":"Karp, R. M., \u201cA patching algorithm for the nonsymmetric traveling-salesman problem,\u201d SIAM J. Comput., 8, 561-573 (1979).","journal-title":"SIAM J. Comput."},{"key":"5124575_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0360-8352(00)00035-8","volume":"38","author":"S. Kumar","year":"2000","unstructured":"Kumar, S., T. P. Bagchi, C. Sriskandarajah, \u201cLot streaming and scheduling heuristics for m-machine no-wait flowshops,\u201d Comput. Indust. Eng., 38, 149-172 (2000).","journal-title":"Comput. Indust. Eng."},{"key":"5124575_CR17","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E. L. Lawler","year":"1985","unstructured":"Lawler, E. L., J. K. Lenstra, and A. H. G. Rinnooy Kan, D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester, UK, 1985."},{"key":"5124575_CR18","first-page":"105","volume":"17","author":"C. L. Monma","year":"1983","unstructured":"Monma, C. L. and A. H. G. Rinnooy Kan, \u201cA concise survey of efficiently solvable special cases of the permutation flow-shop problem,\u201d RAIRO Recherche Op\u00e9rationelle, 17, 105-119 (1983).","journal-title":"RAIRO Recherche Op\u00e9rationelle"},{"key":"5124575_CR19","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1287\/opre.39.4.623","volume":"39","author":"C. E. Noon","year":"1991","unstructured":"Noon, C. E. and J. C. Bean, \u201cA Lagrangian based approach for the asymmetric generalized traveling salesman problem,\u201d Oper. Res., 39, 623-632 (1991).","journal-title":"Oper. Res."},{"key":"5124575_CR20","first-page":"39","volume":"31","author":"C. E. Noon","year":"1993","unstructured":"Noon, C. E. and J. C. Bean, \u201cAn efficient transformation of the generalized traveling salesman problem,\u201d INFOR, 31, 39-44 (1993).","journal-title":"INFOR"},{"key":"5124575_CR21","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M., Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995."},{"key":"5124575_CR22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0167-6377(89)90013-8","volume":"8","author":"C. N. Potts","year":"1989","unstructured":"Potts, C. N. and K. R. Baker, \u201cFlowshop scheduling with lot streaming,\u201d Oper. Res. Lett., 8, 297-303 (1989).","journal-title":"Oper. Res. Lett."},{"key":"5124575_CR23","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"C. N. Potts","year":"1992","unstructured":"Potts, C. N. and L. N. Van Wassenhove, \u201cIntegrating scheduling with batching and lot-sizing: A review of algorithms and complexity,\u201d J. Oper. Res. Soc., 43, 395-406 (1992).","journal-title":"J. Oper. Res. Soc."},{"key":"5124575_CR24","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/62.65","volume":"31","author":"H. R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H., \u201cThe three machine no-wait flowshop problem in NP-complete,\u201d J. Assoc. Comput. Mach., 31, 336-345 (1984).","journal-title":"J. Assoc. Comput. Mach."},{"key":"5124575_CR25","first-page":"695","volume":"31","author":"C. Sriskandarajah","year":"1999","unstructured":"Sriskandarajah, C. and E. Wagneur, \u201cLot streaming and scheduling multiple products in two-machine no-wait flowshops,\u201d IIE Trans., 31, 695-707 (1999).","journal-title":"IIE Trans."},{"key":"5124575_CR26","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1287\/opre.41.6.1065","volume":"41","author":"D. Trietsch","year":"1993","unstructured":"Trietsch, D. and K. R. Baker, \u201cBasic techniques for lot streaming,\u201d Oper. Res., 41, 1065-1076 (1993).","journal-title":"Oper. Res."},{"key":"5124575_CR27","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/0377-2217(93)E0366-6","volume":"85","author":"R. G. Vickson","year":"1995","unstructured":"Vickson, R. G., \u201cOptimal lot streaming for multiple products in a two-machine flowshop,\u201d Eur. J. Oper. Res., 85, 556-575 (1995).","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024042209719.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024042209719\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024042209719.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:50:04Z","timestamp":1751633404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024042209719"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["5124575"],"URL":"https:\/\/doi.org\/10.1023\/a:1024042209719","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}