{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:33:18Z","timestamp":1648956798532},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"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":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1016\/j.cie.2011.04.020","type":"journal-article","created":{"date-parts":[[2011,5,11]],"date-time":"2011-05-11T00:46:40Z","timestamp":1305074800000},"page":"647-654","source":"Crossref","is-referenced-by-count":16,"title":["Flowshop scheduling of deteriorating jobs on dominating machines"],"prefix":"10.1016","volume":"61","author":[{"given":"C.T.","family":"Ng","sequence":"first","affiliation":[]},{"given":"J.-B.","family":"Wang","sequence":"additional","affiliation":[]},{"given":"T.C.E.","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"S.S.","family":"Lam","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2011.04.020_b0005","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/nav.3800290311","article-title":"Flowshop\/no-idle or no-wait scheduling to minimize the sum of completion times","volume":"29","author":"Adiri","year":"1982","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.cie.2011.04.020_b0010","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","article-title":"Scheduling with time dependent processing processing times: Review and extensions","volume":"50","author":"Alidaee","year":"1999","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cie.2011.04.020_b0015","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0377-2217(01)00356-3","article-title":"Nonpreemptive flowshop scheduling with machine dominance","volume":"139","author":"\u010cepek","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2011.04.020_b0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","article-title":"A concise survey of scheduling with time-dependent processing times","volume":"152","author":"Cheng","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2011.04.020_b0025","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.ejor.2006.10.043","article-title":"Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines","volume":"183","author":"Cheng","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2011.04.020_b0030","series-title":"Comuters and intractability: A guided tour to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.cie.2011.04.020_b0035","series-title":"Time-dependent scheduling","author":"Gawiejnowicz","year":"2008"},{"key":"10.1016\/j.cie.2011.04.020_b0040","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.cie.2011.04.020_b0045","series-title":"Inequalities","author":"Hardy","year":"1964"},{"key":"10.1016\/j.cie.2011.04.020_b0050","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0305-0548(94)E0007-T","article-title":"Flowshop scheduling with dominant machines","volume":"22","author":"Ho","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.cie.2011.04.020_b0055","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\/j.cie.2011.04.020_b0060","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1057\/palgrave.jors.2601117","article-title":"NP-hard cases in scheduling deteriorating jobs on dedicated machines","volume":"52","author":"Kononov","year":"2001","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cie.2011.04.020_b0065","first-page":"2111","article-title":"Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates","volume":"36","author":"Lee","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"10.1016\/j.cie.2011.04.020_b0070","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/j.cie.2007.10.010","article-title":"A two-machine flowshop makespan scheduling problem with deteriorating jobs","volume":"54","author":"Lee","year":"2008","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2011.04.020_b0075","first-page":"105","article-title":"A concise survey of efficient solvable special cases of the permutation flowshop problem","volume":"17","author":"Monma","year":"1983","journal-title":"RAIRO Recherche Op\u00e9rationelle"},{"key":"10.1016\/j.cie.2011.04.020_b0080","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0166-218X(00)00385-1","article-title":"Complexity analysis of job-shop scheduling with deteriorating jobs","volume":"117","author":"Mosheiov","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.cie.2011.04.020_b0085","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(92)90175-9","article-title":"Flow-shops with a dominant machine","volume":"62","author":"Nouweland","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2011.04.020_b0090","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.ejor.2008.12.029","article-title":"A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines","volume":"200","author":"Sun","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2011.04.020_b0095","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1016\/j.apm.2008.01.013","article-title":"Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration","volume":"33","author":"Tang","year":"2009","journal-title":"Applied Mathematical Modelling"},{"key":"10.1016\/j.cie.2011.04.020_b0100","doi-asserted-by":"crossref","first-page":"2043","DOI":"10.1016\/j.cor.2005.08.008","article-title":"Flow shop scheduling problems with decreasing linear deterioration under dominating machines","volume":"34","author":"Wang","year":"2007","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2011.04.020_b0105","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1007\/s00170-009-2314-2","article-title":"Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan","volume":"48","author":"Wang","year":"2010","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"10.1016\/j.cie.2011.04.020_b0110","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.amc.2005.11.162","article-title":"Minimizing total completion time in a two-machine flow shop with deteriorating jobs","volume":"180","author":"Wang","year":"2006","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.cie.2011.04.020_b0115","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.omega.2004.10.006","article-title":"Flow shop scheduling with deteriorating jobs under dominating machines","volume":"34","author":"Wang","year":"2006","journal-title":"Omega"},{"key":"10.1016\/j.cie.2011.04.020_b0120","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1057\/palgrave.jors.2601959","article-title":"Flow shop scheduling problems with deteriorating jobs under dominating machines","volume":"57","author":"Wang","year":"2006","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cie.2011.04.020_b0125","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/j.ijpe.2005.11.005","article-title":"Two-machine flowshop scheduling to minimize mean flow time under linear deterioration","volume":"103","author":"Wu","year":"2006","journal-title":"International Journal of Production Economics"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835211001215?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835211001215?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T21:56:06Z","timestamp":1543787766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835211001215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["S0360835211001215"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2011.04.020","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}