{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:56:46Z","timestamp":1761893806967},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1016\/s0377-2217(02)00910-4","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"439-454","source":"Crossref","is-referenced-by-count":10,"title":["Case study on statistically estimating minimum makespan for flow line scheduling problems"],"prefix":"10.1016","volume":"155","author":[{"given":"Amy D","family":"Wilson","sequence":"first","affiliation":[]},{"given":"Russell E","family":"King","sequence":"additional","affiliation":[]},{"given":"James R","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00910-4_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01581033","article-title":"A stochastic method for global optimization","volume":"22","author":"Boender","year":"1982","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0377-2217(84)90004-3","article-title":"On the quality of heuristic solutions to a 19\u00d719 quadratic assignment problem","volume":"17","author":"Bruijs","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1093\/biomet\/66.2.367","article-title":"Statistical inference for bounds of random variables","volume":"66","author":"Cooke","year":"1979","journal-title":"Biometrika"},{"issue":"12","key":"10.1016\/S0377-2217(02)00910-4_BIB4","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1287\/mnsc.23.12.1273","article-title":"Procedures for estimating optimal solution values for large combinatorial problems","volume":"23","author":"Dannenbring","year":"1977","journal-title":"Management Science"},{"issue":"5","key":"10.1016\/S0377-2217(02)00910-4_BIB5","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1287\/opre.33.5.1024","article-title":"Using confidence limits for the global optimum in combinatorial optimization","volume":"33","author":"Derigs","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1017\/S0305004100015681","article-title":"Limiting forms of the frequency distribution of the largest or smallest member of a sample","volume":"24","author":"Fisher","year":"1928","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"issue":"1","key":"10.1016\/S0377-2217(02)00910-4_BIB7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800260108","article-title":"Interval estimation of a global optimum for large combinatorial problems","volume":"26","author":"Golden","year":"1979","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0377-2217(87)90142-1","article-title":"Heuristic solutions and confidence intervals for the multicovering problem","volume":"31","author":"Gonsalvez","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB9","series-title":"Statistics of Extremes","author":"Gumbel","year":"1958"},{"issue":"4","key":"10.1016\/S0377-2217(02)00910-4_BIB10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","article-title":"Two-stage, hybrid flowshop scheduling problem","volume":"39","author":"Gupta","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018976827443","article-title":"Scheduling a two-stage hybrid flow shop with parallel machines at the first stage","volume":"69","author":"Gupta","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(02)00910-4_BIB12","doi-asserted-by":"crossref","first-page":"639","DOI":"10.2307\/1266401","article-title":"Maximum-likelihood estimation of the parameters of gamma and weibull populations from complete and censored samples","volume":"7","author":"Harter","year":"1965","journal-title":"Technometrics"},{"issue":"1","key":"10.1016\/S0377-2217(02)00910-4_BIB13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/00401706.1967.10490454","article-title":"Errata","volume":"9","author":"Harter","year":"1967","journal-title":"Technometrics"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB14","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0377-2217(91)90080-F","article-title":"A new heuristic for the n-job, M-machine, flow-shop problem","volume":"52","author":"Ho","year":"1991","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0377-2217(02)00910-4_BIB15","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1287\/ijoc.12.4.272.11879","article-title":"A revised simplex search procedure for stochastic simulation response-surface optimization","volume":"12","author":"Humphrey","year":"2000","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB16","series-title":"Simulation Modeling and Analysis","author":"Law","year":"1991"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB17","series-title":"Extremes and Related Properties of Random Sequences and Processes","author":"Leadbetter","year":"1983"},{"issue":"2","key":"10.1016\/S0377-2217(02)00910-4_BIB18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0191-2615(82)90030-3","article-title":"Combinatorial programming, statistical optimization and the optimal transportation network problem","volume":"16","author":"Los","year":"1982","journal-title":"Transportation Research B"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB19","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1287\/opre.19.6.1331","article-title":"A search model for evaluating combinatorially explosive problems","volume":"19","author":"McRoberts","year":"1971","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00910-4_BIB20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/00224065.1974.11980616","article-title":"A sequential simplex program for solving minimization problems","volume":"6","author":"Olsson","year":"1974","journal-title":"Journal of Quality Technology"},{"issue":"1","key":"10.1016\/S0377-2217(02)00910-4_BIB21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.2307\/1267998","article-title":"The Nelder\u2013Mead simplex procedure for function minimization","volume":"17","author":"Olsson","year":"1975","journal-title":"Technometrics"},{"issue":"6","key":"10.1016\/S0377-2217(02)00910-4_BIB22","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","article-title":"Simulated annealing for permutation flow-shop scheduling","volume":"17","author":"Osman","year":"1989","journal-title":"Omega"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB23","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1023\/A:1009669326107","article-title":"Integrating interval estimates of global optima and local search methods for combinatorial optimization problems","volume":"6","author":"Ovacik","year":"2000","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/biomet\/51.1-2.33","article-title":"Estimation of a truncation point","volume":"51","author":"Robson","year":"1964","journal-title":"Biometrika"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB25","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1080\/00949658808811068","article-title":"Least-squares estimation of distribution functions in Johnson\u2019s translation system","volume":"29","author":"Swain","year":"1988","journal-title":"Journal of Statistical Computation and Simulation"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for the flow shop sequencing problem","volume":"47","author":"Taillard","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB27","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1093\/biomet\/67.3.712","article-title":"A note on estimation of bounds of random variables","volume":"67","author":"Van der Watt","year":"1980","journal-title":"Biometrika"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB28","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/nav.3800310118","article-title":"An efficient heuristic for large set covering problems","volume":"31","author":"Vasko","year":"1984","journal-title":"Naval Research Logistics Quarterly"},{"issue":"9","key":"10.1016\/S0377-2217(02)00910-4_BIB29","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1080\/15458830.1996.11770716","article-title":"Using univariate B\u00e9zier distributions to model simulation input processes","volume":"28","author":"Wagner","year":"1996","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB30","unstructured":"Wilson, A.D., 2001. Scheduling nonsimilar groups of jobs on a flow line. Ph.D. dissertation, North Carolina State University"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB31","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/00949657908810302","article-title":"A simulation study of some simple estimators for the three-parameter Weibull distribution","volume":"9","author":"Zanakis","year":"1979","journal-title":"Journal of Statistical Computation and Simulation"},{"key":"10.1016\/S0377-2217(02)00910-4_BIB32","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/0377-2217(94)00021-4","article-title":"Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge","volume":"85","author":"Zegordi","year":"1995","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702009104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702009104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T09:46:38Z","timestamp":1584524798000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702009104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S0377221702009104"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00910-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}