{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T04:21:03Z","timestamp":1770524463554,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0377-2217(00)00142-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:50Z","timestamp":1027634690000},"page":"528-538","source":"Crossref","is-referenced-by-count":46,"title":["A flexible flowshop problem with total flow time minimization"],"prefix":"10.1016","volume":"132","author":[{"given":"Meral","family":"Azizo\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ergin","family":"\u00c7akmak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suna","family":"Kondakci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00142-9_BIB1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(90)90244-6","article-title":"Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flowshop","volume":"44","author":"Ahmadi","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB2","first-page":"10","article-title":"An extension of two machines sequencing problem","volume":"8","author":"Arthanari","year":"1971","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB3","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1080\/05695557708975160","article-title":"Minimizing the sum of completion times of n-jobs over m-machines in a flowshop \u2013 a branch and bound approach","volume":"9","author":"Bansal","year":"1977","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(91)90148-O","article-title":"Branch and bound algorithm for the flowshop with multiple processor","volume":"51","author":"Brah","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB5","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1057\/jors.1991.132","article-title":"Textile production systems: A succession of non-identical parallel processor shops","volume":"42","author":"Guinet","year":"1991","journal-title":"Journal of Operations Research Society"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB8","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1080\/00207549608904988","article-title":"Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time","volume":"34","author":"Guinet","year":"1996","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","article-title":"Two stage hybrid flowshop sequencing problem","volume":"39","author":"Gupta","year":"1988","journal-title":"Journal of Operations Research Society"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB10","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1080\/00207549108948025","article-title":"Optimality criteria for flow shop schedules","volume":"29","author":"Gupta","year":"1971","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0377-2217(94)90407-3","article-title":"Scheduling a two-stage hybrid flowshop with separable setup and removal times","volume":"77","author":"Gupta","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB12","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0377-2217(91)90080-F","article-title":"A new heuristic for the n-job m-machine flow shop problem","volume":"52","author":"Ho","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB13","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","article-title":"Application of branch and bound technique to some flow shop problem","volume":"13","author":"Ignall","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two and three stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB15","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0305-0483(97)00015-7","article-title":"Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage","volume":"25","author":"Kim","year":"1998","journal-title":"Omega"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB17","first-page":"50","article-title":"Two machine sequencing problem with parallel machines","volume":"9","author":"Mittal","year":"1972","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.15807\/jorsj.21.287","article-title":"An adjacent pairwise approach to the mean flowtime scheduling problem","volume":"21","author":"Miyazaki","year":"1978","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB19","first-page":"42","article-title":"On two machine sequencing problem with parallel machines","volume":"11","author":"Murty","year":"1974","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB20","doi-asserted-by":"crossref","unstructured":"Panwalkar, S.S., Dudek, R.A., Smith, M.L., 1972. Sequencing research and the industrial scheduling problem. In: Proceedings of the Symposium on Theory of Scheduling and Its Applications, Berlin","DOI":"10.1007\/978-3-642-80784-8_2"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB21","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/0377-2217(92)90361-C","article-title":"An efficient heuristic approach to the scheduling of jobs in a flowshop","volume":"61","author":"Rajendran","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0377-2217(92)90310-6","article-title":"A multi-stage parallel-processor flowshop problem with minimum flowtime","volume":"57","author":"Rajendran","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB23","unstructured":"Rajendran, C., Narendan, T.T., Chaudhuri, D., 1986. A branch and bound algorithm for scheduling in a flow shop. In: Proceedings of the XIX Annual Convention of the Operational Society of India, vol. 57, New Delhi, pp. 472\u2013484"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB24","doi-asserted-by":"crossref","unstructured":"Salvador, M.S., 1973. A solution of a special class of flowshop scheduling problems. In: Proceedings of the Symposium on the Theory of Scheduling and its Applications. Springer, Berlin, pp. 83\u201391","DOI":"10.1007\/978-3-642-80784-8_7"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB25","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.16.3.687","article-title":"A proof of the optimality of shortest remaining processing time discipline","volume":"16","author":"Schrage","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB26","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0377-2217(89)90208-7","article-title":"Scheduling algorithms for flexible flowshops: Worst and average case performance","volume":"43","author":"Sriskandarajah","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00142-9_BIB27","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-188X(90)90049-N","article-title":"Scheduling a flexible machining centre","volume":"19","author":"Zijm","year":"1990","journal-title":"Engineering Costs and Production Economics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001429?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001429?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T19:30:06Z","timestamp":1580239806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700001429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0377221700001429"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00142-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}