{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:55:19Z","timestamp":1761486919635},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00485-x","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T10:52:50Z","timestamp":1043923970000},"page":"513-522","source":"Crossref","is-referenced-by-count":57,"title":["Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times"],"prefix":"10.1016","volume":"149","author":[{"given":"Chandrasekharan","family":"Rajendran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00485-X_BIB1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","article-title":"A review of scheduling research involving setup considerations","volume":"27","author":"Allahverdi","year":"1999","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB2","doi-asserted-by":"crossref","first-page":"1661","DOI":"10.1080\/002075499191184","article-title":"Scheduling with shutdowns and sequence dependent set-up times","volume":"37","author":"Asano","year":"1999","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB3","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","article-title":"A tabu search approach for the flow shop scheduling problem","volume":"109","author":"Ben-Daya","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB5","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n-job, m-machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/nav.3800210311","article-title":"Two-machine flowshop scheduling problem with sequence dependent setup times: A dynamic programming approach","volume":"21","author":"Corwin","year":"1974","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB7","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1057\/jors.1995.184","article-title":"A savings index heuristic algorithm for flowshop scheduling with sequence dependent set-up times","volume":"46","author":"Das","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB8","series-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job-shop","author":"French","year":"1982"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"Complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/00207547808930015","article-title":"Four simple heuristics for scheduling a flow-shop","volume":"16","author":"Gelders","year":"1978","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB11","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","article-title":"Application of the branch-and-bound technique to some flowshop scheduling problems","volume":"13","author":"Ignall","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB12","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0377-2217(93)E0235-P","article-title":"Modified simulated annealing algorithms for the flow shop sequencing problems","volume":"81","author":"Ishibuchi","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB14","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0377-2217(00)00137-5","article-title":"Constructive and composite heuristic solutions to the P\/\u03a3Ci scheduling problem","volume":"132","author":"Liu","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flowshop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB16","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","article-title":"A fast tabu search algorithm for the permutation flow-shop problem","volume":"91","author":"Nowicki","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB17","series-title":"SCHEDULING Theory, Algorithms and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB18","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1080\/00207540050028070","article-title":"Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times","volume":"38","author":"Radhakrishnan","year":"2000","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB19","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1080\/00207549408957083","article-title":"A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria","volume":"32","author":"Rajendran","year":"1994","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB20","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1080\/095372897234902","article-title":"Heuristics for scheduling in a flowshop with setup, processing and removal times separated","volume":"8","author":"Rajendran","year":"1997","journal-title":"Production Planning and Control"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB21","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1080\/00207548608919815","article-title":"A MILP model for the n-job, M-stage flowshop, with sequence dependent setup times","volume":"24","author":"Srikar","year":"1986","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB22","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1080\/00207540010029433","article-title":"Two MILP models for the N\u00d7M SDST flowshop sequencing problem","volume":"39","author":"Tseng","year":"2001","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00485-X_BIB23","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","article-title":"A new heuristic method for the flowshop sequencing problem","volume":"41","author":"Widmer","year":"1989","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200485X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200485X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:57:27Z","timestamp":1553914647000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170200485X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S037722170200485X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00485-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}