@article{wilson_king_wilson_2004, title={Case study on statistically estimating minimum makespan for flow line scheduling problems}, volume={155}, ISSN={0377-2217}, url={http://dx.doi.org/10.1016/S0377-2217(02)00910-4}, DOI={10.1016/S0377-2217(02)00910-4}, abstractNote={Lower bounds are typically used to evaluate the performance of heuristics for solving combinatorial minimization problems. In the absence of tight analytical lower bounds, optimal objective-function values may be estimated statistically. In this paper, extreme value theory is used to construct confidence-interval estimates of the minimum makespan achievable when scheduling nonsimilar groups of jobs on a two-stage flow line. Experimental results based on randomly sampled solutions to each of 180 randomly generated test problems revealed that (i) least-squares parameter estimators outperformed standard analytical estimators for the Weibull approximation to the distribution of the sample minimum makespan; (ii) to evaluate each Weibull fit reliably, both the Anderson–Darling and Kolmogorov–Smirnov goodness-of-fit tests should be used; and (iii) applying a local improvement procedure to a large sample of randomly generated initial solutions improved the probability that the resulting Weibull fit yielded a confidence interval covering the minimum makespan.}, number={2}, journal={European Journal of Operational Research}, publisher={Elsevier BV}, author={Wilson, Amy D and King, Russell E and Wilson, James R}, year={2004}, month={Jun}, pages={439–454} }
 @article{wilson_king_hodgson_2004, title={Scheduling non-similar groups on a flow line: multiple group setups}, volume={20}, DOI={10.1016/j.reim.2004.07.002}, number={6}, journal={Robotics and Computer-Integrated Manufacturing}, author={Wilson, A. D. and King, R. E. and Hodgson, Thom}, year={2004}, pages={505–515} }
 @article{thoney_hodgson_king_taner_wilson_2002, title={Satisfying due-dates in large multi-factory supply chains}, volume={34}, ISSN={["1545-8830"]}, DOI={10.1080/07408170208928913}, abstractNote={A procedure is developed for the simultaneous scheduling of multi-factory supply chains, including inter-factory transportation. A job-shop scheduling procedure, known to provide near-optimal solutions to industrial-sized problems, is enhanced to include transportation elements in the fundamental model. In order to demonstrate the quality of the solutions, a lower bound calculation is compared to the procedure's solutions on a number of large-scale test problems. The lower bound is an enhancement of the classic lower bound calculation for the N-job, M-machine job shop. The computational effort in scheduling is linear in the size of the problem, and high quality solutions to large-scale problems can be obtained in seconds.}, number={9}, journal={IIE TRANSACTIONS}, publisher={Informa UK Limited}, author={Thoney, KA and Hodgson, TJ and King, RE and Taner, MR and Wilson, AD}, year={2002}, month={Sep}, pages={803–811} }