{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:07:43Z","timestamp":1726513663000},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0166-218x(96)00121-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"123-140","source":"Crossref","is-referenced-by-count":7,"title":["A variant of the permutation flow shop model with variable processing times"],"prefix":"10.1016","volume":"76","author":[{"given":"G.","family":"Finke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00121-7_BIB1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0305-0548(91)90033-N","article-title":"Single machine scheduling with nonlinear cost functions","volume":"18","author":"Alidaee","year":"1991","journal-title":"Computers and Oper. Res."},{"key":"10.1016\/S0166-218X(96)00121-7_BIB2","series-title":"Scheduling under Resource Constraints: Deterministic Models","author":"Blazewicz","year":"1986"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB3","series-title":"Scheduling in Computer and Manufacturing Systems","author":"Blazewicz","year":"1993"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB4","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1287\/opre.42.3.504","article-title":"Flow shop scheduling with resource flexibility","volume":"48","author":"Daniels","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00121-7_BIB5","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1287\/mnsc.33.8.1001","article-title":"Parallel machine scheduling with processing rates dependent on number of jobs in operation","volume":"33","author":"Dror","year":"1987","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(96)00121-7_BIB6","series-title":"Proceeding of the International Conference on Industrial Engineering and Production Management","first-page":"285","article-title":"Permutation flow-shops with state-dependent processing times","author":"Finke","year":"1995"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state variable machine: a solvable case of the traveling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/S0166-218X(96)00121-7_BIB8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","article-title":"Single facility scheduling with nonlinear processing times","volume":"14","author":"Gupta","year":"1988","journal-title":"Comput. Ind. Engng"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB9","article-title":"Machine scheduling problems with blocking and no-wait in process, Toronto","author":"Hall","year":"1991","journal-title":"Working Paper 91-05"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB10","series-title":"Large Scale Systems: Theory and Applications","first-page":"602","article-title":"Flow-shop scheduling with controllable operation processing times","author":"Janiak","year":"1986"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB11","first-page":"1","article-title":"Minimization of the total resource consumption in permutation flow-shop sequencing subject to a given makespan","volume":"13","author":"Janiak","year":"1988","journal-title":"J. Modell Simul Control"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB12","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1080\/00207548808947920","article-title":"General flow-shop scheduling with resource constraints","volume":"26","author":"Janiak","year":"1988","journal-title":"Internat. J. Production Res."},{"key":"10.1016\/S0166-218X(96)00121-7_BIB13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(89)90009-4","article-title":"Minimization of resource consumption under a given deadline in two-processor flow-shop scheduling problem","volume":"32","author":"Janiak","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(96)00121-7_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 Res. Logis. Quart."},{"key":"10.1016\/S0166-218X(96)00121-7_BIB15","article-title":"On some discrete-continuous scheduling problems","author":"J\u00f2zefowska","year":"1994","journal-title":"Research Report RA-94\/003 Poznan University of Technology"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB16","article-title":"Scheduling deteriorating jobs to minimize makespan","author":"Kubiak","year":"1994"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB17","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1057\/jors.1989.159","article-title":"Scheduling of a two-machine flowshop with processing time linearly dependent on job waiting-time","volume":"40","author":"Sriskandarajah","year":"1989","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(96)00121-7_BIB18","first-page":"193","article-title":"Hierarchical control of the two processor flow-shop with state-dependent processing times: Complexity analysis and approximate algorithms","volume":"29","author":"Sriskandarajah","year":"1991","journal-title":"INFOR"},{"key":"10.1016\/S0166-218X(96)00121-7_BIB19","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1002\/1520-6750(199308)40:5<697::AID-NAV3220400511>3.0.CO;2-V","article-title":"The two-machine permutation flow shop with state-dependent processing times","volume":"40","author":"Wagneur","year":"1993","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0166-218X(96)00121-7_BIB20","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01439161","article-title":"Optimal control of a class of DEDS: Flow-shops with state-dependent processing times","volume":"3","author":"Wagneur","year":"1993","journal-title":"Discrete Event Dynamic Systems: Theory Appl."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:29:03Z","timestamp":1556130543000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96001217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0166218X96001217"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00121-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}