{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T07:00:12Z","timestamp":1711436412591},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"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 Mathematics and Computation"],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1016\/j.amc.2006.04.052","type":"journal-article","created":{"date-parts":[[2006,6,13]],"date-time":"2006-06-13T10:50:55Z","timestamp":1150195855000},"page":"947-954","source":"Crossref","is-referenced-by-count":10,"title":["Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time"],"prefix":"10.1016","volume":"182","author":[{"given":"Ji-Bo","family":"Wang","sequence":"first","affiliation":[]},{"given":"Feng","family":"Shan","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Li-Yan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2006.04.052_bib1","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 Quarterly"},{"key":"10.1016\/j.amc.2006.04.052_bib2","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.amc.2006.04.052_bib3","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\/j.amc.2006.04.052_bib4","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.amc.2006.04.052_bib5","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.amc.2006.04.052_bib6","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.amc.2006.04.052_bib7","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\/j.amc.2006.04.052_bib8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1051\/ro\/1983170201051","article-title":"A concise survey of efficient solvable special cases of the permutation flowshop problem","volume":"17","author":"Monma","year":"1983","journal-title":"RAIRO"},{"key":"10.1016\/j.amc.2006.04.052_bib9","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.amc.2006.04.052_bib10","series-title":"Scheduling: Theory","author":"Pinedo","year":"1995"},{"key":"10.1016\/j.amc.2006.04.052_bib11","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/62.65","article-title":"The three-machine no-wait flow shop problem is NP-compulete","volume":"31","author":"Ro\u02c7ck","year":"1984","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.amc.2006.04.052_bib12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01919082","article-title":"Some new results in flow shop scheduling","volume":"28","author":"Ro\u02c7ck","year":"1984","journal-title":"Zeitschrift fu\u02c7r Operational Research"},{"key":"10.1016\/j.amc.2006.04.052_bib13","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF02936066","article-title":"No-wait or no-idle permutation flowshop scheduling with dominating machines","volume":"17","author":"Wang","year":"2005","journal-title":"Journal of Applied Mathematics and Computing"},{"key":"10.1016\/j.amc.2006.04.052_bib14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0925-5273(99)00106-1","article-title":"Solvable cases of permutation flowshop scheduling with dominating machines","volume":"66","author":"Xiang","year":"2000","journal-title":"International Journal of Production Economics"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300306004103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300306004103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T15:51:59Z","timestamp":1547567519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300306004103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["S0096300306004103"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2006.04.052","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2006,11]]}}}