{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T22:08:00Z","timestamp":1722550080348},"reference-count":27,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"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":1599,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical and Computer Modelling"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1016\/j.mcm.2008.02.004","type":"journal-article","created":{"date-parts":[[2008,4,18]],"date-time":"2008-04-18T12:21:41Z","timestamp":1208521301000},"page":"991-1011","source":"Crossref","is-referenced-by-count":34,"title":["Schedule execution for two-machine flow-shop with interval processing times"],"prefix":"10.1016","volume":"49","author":[{"given":"N.M.","family":"Matsveichuk","sequence":"first","affiliation":[]},{"given":"Yu.N.","family":"Sotskov","sequence":"additional","affiliation":[]},{"given":"N.G.","family":"Egorova","sequence":"additional","affiliation":[]},{"given":"T.-C.","family":"Lai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.mcm.2008.02.004_b1","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/j.mcm.2008.02.004_b2","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1080\/07408179908969849","article-title":"Two-machine flowshop problem with arbitrary processing time distributions","volume":"31","author":"Elmaghraby","year":"2000","journal-title":"IIE Transactions"},{"key":"10.1016\/j.mcm.2008.02.004_b3","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/S0377-2217(97)00424-4","article-title":"Stochastically minimizing the makespan in two-machine flow shops without blocking","volume":"112","author":"Kamburowski","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.mcm.2008.02.004_b4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.34.1.130","article-title":"On Johnson\u2019s two-machine flow-shop with random processing times","volume":"34","author":"Ku","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/j.mcm.2008.02.004_b5","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1016\/j.ejor.2004.09.056","article-title":"Johnson\u2019s problem with stochastic processing times and optimal service level","volume":"169","author":"Portougal","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.mcm.2008.02.004_b6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0377-2217(97)00438-4","article-title":"Stochastically minimizing total flowtime in flowshops with no waiting space","volume":"113","author":"Allahverdi","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.mcm.2008.02.004_b7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0895-7177(94)90202-X","article-title":"Two-machine ordered flowshop scheduling under random breakdowns","volume":"20","author":"Allahverdi","year":"1994","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/j.mcm.2008.02.004_b8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0895-7177(97)00132-5","article-title":"Optimal makespan scheduling with given bounds of processing times","volume":"26","author":"Lai","year":"1997","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/j.mcm.2008.02.004_b9","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.mcm.2008.02.004_b10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.ejor.2004.03.025","article-title":"Approximation schemes for job shop scheduling problems with controllable processing times","volume":"167","author":"Jansen","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.mcm.2008.02.004_b11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/00207548808947920","article-title":"General flow-shop scheduling with resource constraints","volume":"26","author":"Janiak","year":"1988","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.mcm.2008.02.004_b12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0377-2217(02)00732-4","article-title":"Single machine batch scheduling with jointly compressible setup and processing times","volume":"153","author":"Ng","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.mcm.2008.02.004_b13","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1016\/j.ejor.2005.06.021","article-title":"Scheduling with controllable release dates and processing times: Makespan minimization","volume":"175","author":"Cheng","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.mcm.2008.02.004_b14","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1057\/palgrave.jors.2600690","article-title":"Sequencing with uncertain numerical data for makespan minimization","volume":"50","author":"Lai","year":"1999","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.mcm.2008.02.004_b15","unstructured":"N.M. Leshchenko, Yu.N. Sotskov, Two-machine minimum-length shop-scheduling problems with uncertain processing times, in: Proceedings of XI-th International Conference \u201cKnowledge-Dialogue-Solution\u201d, vol. 2, Varna, Bulgaria, June 20\u20130, 2005 pp. 375\u2013381"},{"key":"10.1016\/j.mcm.2008.02.004_b16","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/S0377-2217(03)00424-7","article-title":"Mean flow time minimization with given bounds of processing times","volume":"159","author":"Lai","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.mcm.2008.02.004_b17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1111\/1475-3995.00393","article-title":"Two-machine flowshop minimum-length scheduling problem with random and bounded processing times","volume":"10","author":"Allahverdi","year":"2003","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.mcm.2008.02.004_b18","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1057\/palgrave.jors.2601682","article-title":"Flowshop scheduling problem to minimize total completion time with random and bounded processing times","volume":"55","author":"Sotskov","year":"2004","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.mcm.2008.02.004_b19","doi-asserted-by":"crossref","first-page":"2475","DOI":"10.1155\/S016117120321019X","article-title":"Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times","volume":"39","author":"Allahverdi","year":"2003","journal-title":"International Journal of Mathematical Sciences"},{"issue":"2","key":"10.1016\/j.mcm.2008.02.004_b20","first-page":"182","article-title":"Realization of an optimal schedule for the two-machine flow-shop with interval job processing times","volume":"14","author":"Leshchenko","year":"2007","journal-title":"International Journal \u201cInformation Theories and Applications\u201d"},{"key":"10.1016\/j.mcm.2008.02.004_b21","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.mcm.2008.02.004_b22","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.mcm.2008.02.004_b23","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","article-title":"Robust scheduling to hedge against processing time uncertainty in single-stage production","volume":"41","author":"Daniels","year":"1995","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/j.mcm.2008.02.004_b24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.47.1.113","article-title":"A graph-theoretical decomposition of the job-shop scheduling problem to achieve scheduling robustness","volume":"47","author":"Wu","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/j.mcm.2008.02.004_b25","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1080\/07408170008963918","article-title":"Robust scheduling of a two-machine flow shop with uncertain processing times","volume":"32","author":"Kouvelis","year":"2000","journal-title":"IIE Transactions"},{"key":"10.1016\/j.mcm.2008.02.004_b26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0167-6377(00)00025-0","article-title":"Minmax regret solutions for minmax optimization problems with uncertainty","volume":"27","author":"Averbakh","year":"2000","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.mcm.2008.02.004_b27","doi-asserted-by":"crossref","first-page":"2167","DOI":"10.1016\/j.dam.2005.04.015","article-title":"Complexity of minimizing the total flow time with interval data and minmax regret criterion","volume":"154","author":"Lebedev","year":"2006","journal-title":"Discrete Applied Mathematics"}],"container-title":["Mathematical and Computer Modelling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0895717708001039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0895717708001039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,29]],"date-time":"2018-12-29T14:26:24Z","timestamp":1546093584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0895717708001039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":27,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["S0895717708001039"],"URL":"https:\/\/doi.org\/10.1016\/j.mcm.2008.02.004","relation":{},"ISSN":["0895-7177"],"issn-type":[{"value":"0895-7177","type":"print"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}