{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:26:56Z","timestamp":1761596816525},"reference-count":46,"publisher":"Elsevier BV","issue":"2","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":["Applied Soft Computing"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s1568-4946(03)00009-7","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T13:47:57Z","timestamp":1057585677000},"page":"139-148","source":"Crossref","is-referenced-by-count":19,"title":["Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times"],"prefix":"10.1016","volume":"3","author":[{"given":"Pei-Chann","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jih-Chang","family":"Hsieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yen-Wen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1568-4946(03)00009-7_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\/S1568-4946(03)00009-7_BIB2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0925-5273(95)00090-9","article-title":"Single machine scheduling using dominance relation to minimize earliness subjective to ready and due times","volume":"44","author":"Asano","year":"1996","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V","article-title":"Scheduling tasks with sequence dependent processing times","volume":"35","author":"Bianco","year":"1988","journal-title":"Naval Res. Logis. Q."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB4","first-page":"24","article-title":"Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost","volume":"3","author":"Bitran","year":"1990","journal-title":"J. Manuf. Oper. Manage."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB5","doi-asserted-by":"crossref","unstructured":"P. Brucker, O. Thiele, A branch and bound algorithm for the general job shop with sequence dependent setup times. OR Spektrum 18 (1996).","DOI":"10.1007\/BF01539706"},{"key":"10.1016\/S1568-4946(03)00009-7_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1018918003761","article-title":"Job shop scheduling with separable sequence-dependent setups","volume":"70","author":"Choi","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB7","unstructured":"R.W. Conway, W.L. Maxwell, L.W. Miller, Theory of Scheduling, Addison-Wesley, MA, 1967."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB8","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/nav.3800210311","article-title":"Two-machine flowshop scheduling problems with sequence dependent setup times: a dynamic programming approach","volume":"21","author":"Corwin","year":"1974","journal-title":"Naval Res. Logis. Q."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB9","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1057\/jors.1995.184","article-title":"A saving index heuristic algorithm for flowshop scheduling with sequence-dependent set-up times","volume":"46","author":"Das","year":"1995","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB10","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1016\/0305-0548(95)00084-4","article-title":"A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties","volume":"23","author":"Feo","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0925-5273(96)00031-X","article-title":"A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times","volume":"43","author":"Franca","year":"1996","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB12","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1080\/00207549308956810","article-title":"Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria","volume":"31","author":"Guinet","year":"1993","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB13","first-page":"206","article-title":"Flowshop schedules with sequence dependent setup times","volume":"29","author":"Gupta","year":"1986","journal-title":"J. Oper. Res. Jpn."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB14","unstructured":"J.N.D. Gupta, Flowshop scheduling with sequence dependent setup times, in: Proceedings of the ORSA\/TIMS National Meeting, Washington, DC, April 1988."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB15","first-page":"6","article-title":"Approximate schedules for the two-machine flowshop with sequence dependent setup times","volume":"1","author":"Gupta","year":"1985","journal-title":"Indian J. Manage. Syst."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB16","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0377-2217(86)90037-8","article-title":"The two-machine sequence dependent flowshop scheduling problem","volume":"24","author":"Gupta","year":"1986","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB17","unstructured":"J.N.D. Gupta, S.R. Das, S. Ghosh, Flowshop Scheduling with Sequence Dependent Setup Times, Working Paper, Department of Management, Ball State University, Muncie, IN 47306, 1995."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB18","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1080\/00207548208947793","article-title":"N jobs and m machines job-shop problems with sequence dependent setup times","volume":"20","author":"Gupta","year":"1982","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB19","unstructured":"J. Holland, Adaptation in Natural and Artificial System, University of Michigan Press."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB20","doi-asserted-by":"crossref","first-page":"1503","DOI":"10.1080\/00207549408957019","article-title":"Impact of sequence-dependent setup times on job shop scheduling performance","volume":"32","author":"Kim","year":"1994","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1080\/07408179708966311","article-title":"A heuristic to minimize the total weighted tardiness with sequence dependent setups","volume":"29","author":"Lee","year":"1997","journal-title":"IEEE Trans."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB22","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/S0377-2217(95)00376-2","article-title":"Scheduling jobs on parallel machines with sequence dependent setup times","volume":"100","author":"Lee","year":"1997","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/S1568-4946(03)00009-7_BIB23","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/70.864235","article-title":"Scheduling flexible flow shops with sequence-dependent setup effects","volume":"16","author":"Liu","year":"2000","journal-title":"IEEE Trans. Robot. Autom."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB24","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1287\/opre.20.4.895","article-title":"A scheduling problem involving sequence dependent changeover costs","volume":"20","author":"Lockett","year":"1972","journal-title":"Oper. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB25","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0360-8352(95)00085-F","article-title":"Job shop scheduling heuristics for sequence-dependent setups","volume":"29","author":"Low","year":"1995","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB26","unstructured":"J.D. Marsh, D.C. Montgomery, Optimal Procedures for Scheduling Jobs with Sequence-Dependent Changeover Times on Parallel Processors, AIIE Technical Papers, 1973, pp. 279\u2013286."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0925-5273(97)00008-X","article-title":"Order release and sequence dependent setup times","volume":"49","author":"Missbauer","year":"1997","journal-title":"J. Prod. Econ."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB28","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/05695557508974982","article-title":"An algorithm for a single-machine scheduling problem with sequence-dependent setup times and scheduling windows","volume":"7","author":"Moore","year":"1975","journal-title":"AIIE Trans."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB29","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0167-6377(93)90089-Y","article-title":"Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times","volume":"14","author":"Ovacik","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB30","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1080\/00207549408956998","article-title":"Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times","volume":"32","author":"Ovacik","year":"1994","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB31","doi-asserted-by":"crossref","first-page":"3173","DOI":"10.1080\/00207549508904867","article-title":"Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup y times","volume":"33","author":"Ovacik","year":"1995","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB32","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0305-0483(94)00057-H","article-title":"A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem","volume":"23","author":"Ozgur","year":"1995","journal-title":"OMEGA"},{"key":"10.1016\/S1568-4946(03)00009-7_BIB33","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/05695557708975137","article-title":"On the use of a vehicle routing algorithm for the parallel processor problems with sequence-dependent changeover costs","volume":"9","author":"Parker","year":"1977","journal-title":"AIIE Trans."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB34","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/095372897235055","article-title":"A simulated annealing heuristic for scheduling to minimize weighted tardiness in a flowshop with sequence dependent setup times of jobs\u2014a case study","volume":"8","author":"Parthasarathy","year":"1997","journal-title":"Prod. Plan. Control"},{"key":"10.1016\/S1568-4946(03)00009-7_BIB35","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0925-5273(97)00017-0","article-title":"An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence dependent setup times of jobs","volume":"49","author":"Parthasarathy","year":"1997","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB36","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","article-title":"The time-dependent traveling salesman problem and its application to the tardiness problem in one machine scheduling","volume":"26","author":"Picard","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB37","unstructured":"M. Pindo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, NJ, 1995."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB38","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0305-0548(93)E0021-K","article-title":"Scheduling in a sequence dependent setup environment with genetic search","volume":"22","author":"Rubin","year":"1995","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB39","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1080\/05695557308974909","article-title":"The problems of tardiness and saturation in a multi class queue with sequence-dependent setups","volume":"5","author":"Sawicki","year":"1973","journal-title":"AIIE Trans."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB40","unstructured":"J.E. Schaller, J.N.D. Gupta, A.J. Vakharia, Group scheduling with sequence dependent setups, in: Proceedings of the Annual Decision Sciences Institute Meeting, San Diego, CA, November 1997, pp. 1141\u20131143."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB41","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0305-0483(92)90075-I","article-title":"Heuristics in flow shop scheduling with sequence dependent setup times","volume":"20","author":"Simons","year":"1992","journal-title":"OMEGA"},{"key":"10.1016\/S1568-4946(03)00009-7_BIB42","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":"Int. J. Prod. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB43","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1002\/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-B","article-title":"A flow-shop problem with sequence-dependent additive setup times","volume":"34","author":"Szwarc","year":"1987","journal-title":"Naval Res. Logis. Q."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB44","first-page":"69","article-title":"Multi-objective sequencing with sequence dependent setup times","volume":"3","author":"Tan","year":"1997","journal-title":"Int. J. Oper. Quant. Manage."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB45","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/00207547708943117","article-title":"Sequence dependent setup times and job sequencing","volume":"15","author":"White","year":"1977","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S1568-4946(03)00009-7_BIB46","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0736-5845(89)90031-8","article-title":"Scheduling in a manufacturing shop with sequence-dependent setups","volume":"5","author":"Zhou","year":"1989","journal-title":"Robot. Comput. Integ. Manuf."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494603000097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494603000097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T16:58:56Z","timestamp":1585069136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494603000097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S1568494603000097"],"URL":"https:\/\/doi.org\/10.1016\/s1568-4946(03)00009-7","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}