@article{fukuzawa_mcconnell_kay_thoney-barletta_warsing_2024, title={Implementing trades of the National Football League Draft on blockchain smart contracts}, volume={1}, ISSN={["2515-7841"]}, url={https://doi.org/10.1108/IJSMS-09-2023-0185}, DOI={10.1108/IJSMS-09-2023-0185}, abstractNote={PurposeDemonstrate proof-of-concept for conducting NFL Draft trades on a blockchain network using smart contracts.}, journal={INTERNATIONAL JOURNAL OF SPORTS MARKETING & SPONSORSHIP}, author={Fukuzawa, Mathew B. and McConnell, Brandon M. and Kay, Michael G. and Thoney-Barletta, Kristin A. and Warsing, Donald P.}, year={2024}, month={Jan} } @article{nelson_king_mcconnell_thoney-barletta_2023, title={US Army Aviation air movement operations assignment, utilization and routing}, volume={7}, url={https://doi.org/10.1108/JDAL-11-2022-0013}, DOI={10.1108/JDAL-11-2022-0013}, abstractNote={PurposeThe purpose of this study was to create an air movement operations planning model to rapidly generate air mission request (AMR) assignment and routing courses of action (COA) in order to minimize unsupported AMRs, aircraft utilization and routing cost.}, number={1}, journal={Journal of Defense Analytics and Logistics}, publisher={Emerald}, author={Nelson, Russell and King, Russell and McConnell, Brandon M. and Thoney-Barletta, Kristin}, year={2023}, month={Sep}, pages={2–28} } @article{hood_thoney-barletta_rothenberg_2023, title={Understanding the role of Instagram in young adult consumers' purchase and post-purchase evaluation behaviors}, volume={8}, ISSN={["1758-7433"]}, url={https://doi.org/10.1108/JFMM-07-2022-0146}, DOI={10.1108/JFMM-07-2022-0146}, abstractNote={PurposeThis study explored the role that Instagram, a prominent social media platform, plays in the consumer decision-making process of young adults (age 18–27 years) in the United States as they shop online for apparel and interact with the digital profiles of apparel brands. Specifically, this study compared consumers' purchase and post-purchase evaluation behaviors on Instagram between Millennials and Generation Z, and investigated the role of consumers' trust of Instagram on these behaviors.}, journal={JOURNAL OF FASHION MARKETING AND MANAGEMENT}, author={Hood, Sara Lewis and Thoney-Barletta, Kristin Anne and Rothenberg, Lori}, year={2023}, month={Aug} } @article{kwon_hegarty_oxenham_thoney-barletta_grant_reid_2019, title={An introduction to a new direct testing method for characterizing pressure in compression fabrics}, volume={110}, ISSN={["1754-2340"]}, DOI={10.1080/00405000.2018.1527966}, abstractNote={Abstract A newly developed direct pressure measuring system known as the CRIM Pressure System was compared with a traditional direct measuring device, the PicoPress Compression System, for compression bandage and hosiery samples. PicoPress measurements were taken both on the CRIM system and on research participants. Initial results indicated a good correlation between CRIM Pressure System and PicoPress participants’ measurements.}, number={6}, journal={JOURNAL OF THE TEXTILE INSTITUTE}, author={Kwon, Cassandra and Hegarty, Meghan and Oxenham, William and Thoney-Barletta, Kristin and Grant, Edward and Reid, Lawrence}, year={2019}, month={Jun}, pages={822–831} } @article{rogers_mcconnell_hodgson_kay_king_parlier_thoney barletta_2018, title={A Military Logistics Network Planning System}, volume={23}, url={http://www.lib.ncsu.edu/resolver/1840.20/36268}, DOI={10.5711/1082598323405}, number={4}, journal={Military Operations Research}, author={Rogers, Matthew B. and McConnell, Brandon M. and Hodgson, Thom J. and Kay, Michael G. and King, Russell E. and Parlier, Greg and Thoney Barletta, Kristen}, year={2018}, pages={5–24} } @article{rogers_mcconnell_hodgson_kay_king_parlier_thoney-barletta_2018, title={A military logistic network planning system (MLNPS)}, journal={Military Operations Research}, author={Rogers, M. and McConnell, B. and Hodgson, T.J. and Kay, M.G. and King, R.E. and Parlier, G. and Thoney-Barletta, K.A.}, year={2018}, month={Apr} } @article{kwon_hegarty_oxenham_thoney-barletta_grant_reid_2018, title={An indirect testing approach for characterizing pressure profiles of compression bandages and hosiery}, volume={109}, ISSN={["1754-2340"]}, DOI={10.1080/00405000.2017.1340079}, abstractNote={Abstract As outlined in compression therapy literature, the performance of a compression textile can be characterized by its stiffness and interface pressure. In this study, an indirect approach for measuring pressure from a set of compression bandages and hosiery was developed, from which rigidity (EI) values were determined, and tension–elongation curves and pressure-elongation data were calculated. The calculated pressure values were compared against PicoPress sensor readings measured on 10 participants. Results showed that the correlation between both approaches varied among bandage and hosiery samples.}, number={2}, journal={JOURNAL OF THE TEXTILE INSTITUTE}, publisher={Informa UK Limited}, author={Kwon, Cassandra and Hegarty, Meghan and Oxenham, William and Thoney-Barletta, Kristin and Grant, Edward and Reid, Lawrence}, year={2018}, pages={256–267} } @article{sas_joines_thoney_king_2018, title={Logistics of carpet recycling in the US: Designing the collection network}, volume={6}, DOI={10.1080/00405000.2018.1480101}, abstractNote={Abstract Efficient collection of post-consumer carpet is an important part of the carpet recycling process that helps to reduce the cost of recycled materials as well as provide sufficient volumes of carpet for recycling facilities. This paper focuses on the design of a collection network for carpet in the U.S. The location set covering optimization model formulated in the paper allows locating the minimum number of collection centers throughout the U.S. to reach a specific level of population coverage and as a result, a target collection rate. To solve real-scale instances of the problem, a novel randomized greedy heuristic is developed. The heuristic is shown to perform better than existing greedy heuristics in the literature. In addition, the paper presents the resulting nationwide carpet collection networks for different levels of population coverage. The results of the study can be used for U.S. carpet recycling policy-making decisions.}, journal={Journal of the Textile Institute}, publisher={Informa UK Limited}, author={Sas, I. and Joines, J.A. and Thoney, K.A. and King, R.E.}, year={2018}, month={Jun}, pages={1–10} } @article{adikorley_thoney-barletta_joines_rothenberg_2017, title={Apparel sourcing in Sub-Saharan Africa Views from apparel sourcing executives and trade policy representatives}, volume={21}, ISSN={["1560-6074"]}, DOI={10.1108/rjta-05-2017-0022}, abstractNote={ Purpose The purpose of this study is to examine why Sub-Saharan Africa (SSA) is not currently a major player in producing apparel for the US market and determine if SSA is likely to become one because of several opportunities that the region offers, including relatively low labor wages, an ample labor force and duty-free access to the USA through the 10-year renewal of AGOA. }, number={3}, journal={RESEARCH JOURNAL OF TEXTILE AND APPAREL}, publisher={Emerald}, author={Adikorley, Ruth Dede and Thoney-Barletta, Kristin and Joines, Jeff and Rothenberg, Lori}, year={2017}, pages={203–218} } @inproceedings{adikorley_thoney-barletta_joines_rothenberg_2017, title={Using stepwise regression and nonparametric tests to analyze the landed cost competitiveness of producing apparel in different countries}, booktitle={Proceedings of the Joint Statistical Meetings 2017}, author={Adikorley, R. and Thoney-Barletta, K.A. and Joines, J. and Rothenberg, L.}, year={2017} } @article{hussein_hodgson_king_jackson_thoney-barletta_2016, title={Forecasting communications technology products with leading economic indicators}, volume={35}, number={3}, journal={The Journal of Business Forecasting}, author={Hussein, J. and Hodgson, T.J. and King, R.E. and Jackson, S.D. and Thoney-Barletta, K.A.}, year={2016}, pages={21–27} } @article{shen_chan_chow_thoney-barletta_2016, title={Inventory management research for the fashion industry}, volume={3}, DOI={10.1504/ijir.2016.10003358}, abstractNote={Fashion products have a short-life-cycle with highly volatile demand uncertainty. This uncertainty leads to challenges in managing inventory, as matching supply and demand is always difficult in the fashion industry. In this paper, we review the recent literature on fashion industry inventory management. We classify the extant literature by four widely-used research methodologies, including analytical, empirical, case study and simulation approaches. We identify that inventory ownership, information technology, and incentive schemes for increasing inventory efficiency are the key factors to enhance inventory management in the fashion industry. We propose that inventory management of luxury fashion, sustainability in inventory, and empirical and case study approaches are the most important directions for future research.}, number={4}, journal={International Journal of Inventory Research}, publisher={Inderscience Publishers}, author={Shen, B. and Chan, H.-L. and Chow, P.-S. and Thoney-Barletta, K.A.}, year={2016}, pages={297–317} } @article{hanson_hodgson_kay_king_thoney-barletta_2015, title={On the economic lot scheduling problem: stock-out prevention and system feasibility}, volume={53}, ISSN={["1366-588X"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-84932193491&partnerID=MN8TOARS}, DOI={10.1080/00207543.2015.1005246}, abstractNote={The Economic Lot Scheduling Problem is a classical scheduling problem with the objective of minimising the long-run inventory and set-up costs of a single machine, multi-product inventory system. Demand rates, production rates and set-up times are assumed to be deterministic. The problem has been extensively studied and methods exist to obtain cyclic schedules which minimise total cost. In order to apply a cyclic schedule without a stock-out occurring, certain initial inventory levels are required. This paper considers the scenario where inventory levels are critically low and the cyclic schedule cannot be applied. Analytical methods are developed to determine: if the initial inventory is sufficient to prevent a stock-out from occurring; the maximum time until a stock-out will occur if a stock-out is unavoidable; and the minimum time required to obtain the necessary inventory to resume the cyclic schedule if a stock-out can be avoided.}, number={16}, journal={INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, publisher={Informa UK Limited}, author={Hanson, Brian B. and Hodgson, Thom J. and Kay, Michael G. and King, Russell E. and Thoney-Barletta, Kristin A.}, year={2015}, month={Aug}, pages={4903–4916} } @article{sas_thoney_joines_king_woolard_2015, title={Reverse Logistics of US Carpet Recycling}, volume={1}, ISBN={["978-3-319-12702-6"]}, ISSN={["2365-6395"]}, DOI={10.1007/978-3-319-12703-3_1}, abstractNote={A high volume of post-consumer carpet (PCC) is discarded each year in the USA, placing significant pressure on landfills and leading to the loss of valuable materials contained in carpets. To explain factors that influence landfill diversion rates for different types of products, an overview of the reverse logistics framework in the literature is provided. The framework is used to analyze the current state of carpet recycling in the USA, and PCC recycling is shown to be a typical material recovery network. Therefore, because PCC recycling requires a high volume of carpet to be collected and transportation costs to be minimized for it to be economical, a well-organized reverse logistics network is critical. In this respect, a review of reverse network design studies for different products is provided and research conducted to design PCC collection and recycling networks is discussed in detail.}, journal={SUSTAINABLE FASHION SUPPLY CHAIN MANAGEMENT: FROM SOURCING TO RETAILING}, publisher={Springer International Publishing}, author={Sas, Iurii and Thoney, Kristin A. and Joines, Jeffrey A. and King, Russell E. and Woolard, Ryan}, editor={Choi, T.C. Edwin Cheng Tsan-MingEditor}, year={2015}, pages={3–30} } @article{lobo_wilson_thoney_hodgson_king_2014, title={A practical method for evaluating worker allocations in large-scale dual resource constrained job shops}, volume={46}, ISSN={0740-817X 1545-8830}, url={http://dx.doi.org/10.1080/0740817X.2014.892231}, DOI={10.1080/0740817x.2014.892231}, abstractNote={In two recent articles, Lobo et al. present algorithms for allocating workers to machine groups in a Dual Resource Constrained (DRC) job shop so as to minimize Lmax , the maximum job lateness. Procedure LBSA delivers an effective lower bound on Lmax , while the heuristic delivers an allocation whose associated schedule has a (usually) near-optimal Lmax  value. To evaluate an HSP-based allocation’s quality in a given DRC job shop, the authors first compute the gap between HSP’s associated Lmax  value and ’s lower bound. Next they refer this gap to the distribution of a “quasi-optimality” gap that is generated as follows: (i) independent simulation replications of the given job shop are obtained by randomly sampling each job’s characteristics; and (ii) for each replication, the associated quasi-optimality gap is computed by enumerating all feasible allocations. Because step (ii) is computationally intractable in large-scale problems, this follow-up article formulates a revised step (ii) wherein each simulation invokes , an improved version of , to yield an approximation to the quasi-optimality gap. Based on comprehensive experimentation, it is concluded that the -based distribution did not differ significantly from its enumeration-based counterpart; and the revised evaluation method was computationally tractable in practice. Two examples illustrate the use of the revised method.}, number={11}, journal={IIE Transactions}, publisher={Informa UK Limited}, author={Lobo, Benjamin J. and Wilson, James R. and Thoney, Kristin A. and Hodgson, Thom J. and King, Russell E.}, year={2014}, month={Jul}, pages={1209–1226} } @inbook{lobo_thoney_hodgson_king_wilson_2014, title={A probabilistic characterization of allocation performance in a worker-constrained job shop}, DOI={10.1007/978-1-4614-9056-2_13}, abstractNote={We analyze a dual resource constrained (DRC) job shop in which both machines and workers are limited, and we seek to minimize L max, the maximum job lateness. An allocation of workers to machine groups is required to generate a schedule, and determining a schedule that minimizes L max is NP-hard. This chapter details a probabilistic method for evaluating the quality of a specific (but arbitrary) allocation in a given DRC job shop scheduling problem based on two recent articles by Lobo et al. (2013a) The first article Lobo et al. (2013b) describes a lower bound on L max given an allocation, and an algorithm to find an allocation yielding the smallest such lower bound, while the second article Lobo et al. (2013b) establishes criteria for verifying the optimality of an allocation. For situations where the optimality criteria are not satisfied, Lobo et al. (2013c) presents HSP, a heuristic search procedure to find allocations enabling the Virtual Factory (a heuristic scheduler developed by Hodgson et al. in 1998) to generate schedules with smaller L max than can be achieved with allocations yielding article 1’s final lower bound. From simulation replications of the given DRC job shop scheduling problem, we estimate the distribution of the difference between (a) the “best” (smallest) L max value achievable with a Virtual Factory–generated schedule, taken over all feasible allocations; and (b) the final lower bound of Lobo et al. (2013b). To evaluate the quality of a specific allocation for the given problem, we compute the difference between L max for the Virtual Factory–generated schedule based on the specific allocation, and the associated lower bound (b) for the problem; then we refer this difference to the estimated distribution to judge the likelihood that the specific allocation yields the Virtual Factory’s “best” schedule (a) for the given problem. We present several examples illustrating the usefulness of our approach, and summarize the lessons learned in this work.}, note={Lobo, B.J., Thoney, K.A., Hodgson, T.J., King, R.E., and Wilson, J.R. (2014). A probabilistic characterization of allocation performance in a worker-constrained job shop. Essays in Production, Project Planning and Scheduling, ed. P.S. Pulat, S.C. Sarin, and R. Uzsoy, 301-342. Springer. A Festschrift in Honor of Dr. Salah E. Elmaghraby, Professor Emeritus, Industrial and Systems Engineering, NCSU.}, booktitle={Essays in Production, Project Planning and Scheduling}, publisher={Springer}, author={Lobo, B.J. and Thoney, K.A. and Hodgson, T.J. and King, R.E. and Wilson, J.R.}, editor={Pulat, P.S. and Sarin, S.C. and Uzsoy, R.Editors}, year={2014}, pages={301–342} } @article{bucci_woolard_joines_thoney_king_2014, title={Incorporating economies of scale into facility location problems in carpet recycling}, volume={105}, ISSN={0040-5000 1754-2340}, url={http://dx.doi.org/10.1080/00405000.2014.890833}, DOI={10.1080/00405000.2014.890833}, abstractNote={The Carpet America Recovery Effort (CARE) set a goal to divert 40% of used carpet from landfills in the United States by 2012, but only achieved a 10% diversion rate. To achieve the 40% diversion rate, approximately 1.4 billion lbs would need to have been diverted. Diverting this significant quantity may require the design of a larger, more effective reverse logistics network to process the used materials. A new facility location heuristic originally developed for the forward distribution of products is applied to the reverse logistics system for carpet recycling. The objective is to locate an unknown number of carpet recycling facilities to minimize the total cost. The model includes transportation costs, as well as fixed facility and processing costs at the recycling plant, the latter exhibiting economies of scale (EOS) as the facility size increases. We evaluate the model using data from the CARE collection network in the continental United States and compare these findings to models that assume a significant increase in collection locations and rates to meet specific carpet diversion targets. We show the impact of EOS of the recycling facilities on the solution structure, as well as the impact that collection volumes have on the solution.}, number={12}, journal={Journal of the Textile Institute}, publisher={Informa UK Limited}, author={Bucci, M.J. and Woolard, R. and Joines, J. and Thoney, K. and King, R.E.}, year={2014}, pages={1300–1311} } @article{lobo_hodgson_king_thoney_wilson_2013, title={Allocating job-shop manpower to minimize Lmax: Optimality criteria, search heuristics, and probabilistic quality metrics}, volume={40}, ISSN={0305-0548}, url={http://dx.doi.org/10.1016/j.cor.2013.02.008}, DOI={10.1016/j.cor.2013.02.008}, abstractNote={We address questions raised by Lobo et al. in 2012 regarding the NP-hard problem of finding an optimal allocation of workers to machine groups in a job shop so as to minimize Lmax, the maximum job lateness. Lobo et al. formulated a lower bound on Lmax given a worker allocation, and an algorithm to find an allocation yielding the smallest such lower bound. In this article we establish optimality criteria to verify that a given allocation corresponds to a schedule that yields the minimum value of Lmax. For situations in which the optimality criteria are not satisfied, we present the Heuristic Search Procedure (HSP), which sequentially invokes three distinct search heuristics, the Local Neighborhood Search Strategy (LNSS), Queuing Time Search Strategy 1 (QSS1), and Queuing Time Search Strategy 2 (QSS2), before delivering the best allocation encountered by LNSS, QSS1, and QSS2. HSP is designed to find allocations allowing a heuristic scheduler to generate schedules with a smaller value of Lmax than that achieved via the allocation yielding the final lower bound of Lobo et al. Comprehensive experimentation indicated that HSP delivered significant reductions in Lmax. We also estimate a probability distribution for evaluating the quality (closeness to optimality) of an allocation delivered by a heuristic search procedure such as HSP. This distribution permits assessing the user's confidence that a given allocation will enable the heuristic scheduler to generate its best possible schedule—i.e., the schedule with the heuristic scheduler's smallest achievable Lmax value.}, number={10}, journal={Computers & Operations Research}, publisher={Elsevier BV}, author={Lobo, B.J. and Hodgson, T.J. and King, R.E. and Thoney, K.A. and Wilson, J.R.}, year={2013}, pages={2569–2584} } @article{lobo_hodgson_king_thoney_wilson_2013, title={An effective lower bound on Lmax in a worker-constrained job shop}, volume={40}, ISSN={0305-0548}, url={http://dx.doi.org/10.1016/j.cor.2012.07.003}, DOI={10.1016/j.cor.2012.07.003}, abstractNote={A common industrial operation is a dual resource constrained job shop where: (a) the objective is to minimize L max , the maximum job lateness; (b) machines are organized into groups; and (c) each worker is assigned to a specific machine group. Because this problem is NP-hard, finding optimal solutions by enumeration is impractical. This paper details a procedure to compute a lower bound on L max that will be used in follow-up work to effectively evaluate the absolute performance of heuristic solutions. Given an allocation of workers to machine groups, a lower bound on L max is first computed for each machine group using a network-flow formulation. The lower bound on L max for the job shop is the largest of the lower bounds for the machine groups. A search algorithm then finds a worker allocation yielding the smallest such lower bound on L max for the job shop; and the latter quantity is our proposed lower bound on L max . Given a worker allocation, we use the Virtual Factory (a heuristic scheduler developed by Hodgson et al. in 1998) to generate a schedule. Experiments with a wide variety of job shops indicated that the proposed lower bound on L max could often be achieved by a Virtual Factory schedule based on the worker allocation yielding this lower bound. However, there were problem instances for which other worker allocations enabled the Virtual Factory to generate better schedules. Follow-up work provides optimality criteria, and heuristics to find improved allocations if these criteria are not satisfied.}, number={1}, journal={Computers & Operations Research}, publisher={Elsevier BV}, author={Lobo, Benjamin J. and Hodgson, Thom J. and King, Russell E. and Thoney, Kristin A. and Wilson, James R.}, year={2013}, month={Jan}, pages={328–343} } @article{lobo_hodgson_king_thoney_wilson_2013, title={An effective lower bound on L-max in a worker-constrained job shop}, volume={40}, number={1}, journal={Computers & Operations Research}, author={Lobo, B. J. and Hodgson, T. J. and King, R. E. and Thoney, K. A. and Wilson, J. R.}, year={2013}, pages={328–343} } @misc{sas_gorga_joines_thoney_2012, title={Literature review on superhydrophobic self-cleaning surfaces produced by electrospinning}, volume={50}, ISSN={["1099-0488"]}, DOI={10.1002/polb.23070}, abstractNote={Abstract}, number={12}, journal={JOURNAL OF POLYMER SCIENCE PART B-POLYMER PHYSICS}, publisher={Wiley}, author={Sas, Iurii and Gorga, Russell E. and Joines, Jeff A. and Thoney, Kristin A.}, year={2012}, month={Jun}, pages={824–845} } @article{hamilton_oxenham_hodge_thoney_2012, title={Optimal data use in staple yarn manufacturing}, volume={103}, ISSN={["0040-5000"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-84860203802&partnerID=MN8TOARS}, DOI={10.1080/00405000.2011.588837}, abstractNote={The contemporary cotton spinning mill is home to modern machinery capable of generating a plethora of data. This data comes in the form of online data, which is real-time data created by the processing machinery, and offline data, which is created via laboratory testing of samples. This paper describes a study which applied statistical techniques to the two data sets. One came from an actual open-end spinning plant. The other was created in a laboratory environment. This analysis served to discover trends within this data sample and to determine the optimal data use for the cotton spinning industry. In addition, the paper presents a perspective into the current state of data management in the cotton spinning industry obtained by visiting an assortment of active spinning mills.}, number={5}, journal={JOURNAL OF THE TEXTILE INSTITUTE}, publisher={Informa UK Limited}, author={Hamilton, B. J. and Oxenham, W. and Hodge, G. L. and Thoney, K. A.}, year={2012}, pages={499–507} } @article{hartman_joines_king_thoney_2012, title={The effect speed and replenishment flexibility has on overall costs of sourcing apparel products}, volume={103}, ISSN={0040-5000 1754-2340}, url={http://dx.doi.org/10.1080/00405000.2011.595106}, DOI={10.1080/00405000.2011.595106}, abstractNote={This research investigates the sourcing of basic and seasonal garments as a function of lead time as well as the ability that providing in-season replenishment orders has on overall costs. Most sourcing decisions are made on the basis of the first cost of the garment with little regard to the potential impact of large hidden costs (i.e. lost sales, inventory costs, markdowns, etc.). A small survey administered to apparel manufacturers and retailers is used to gather perspectives on sourcing from various regions of the world. However, its primary purpose is to gather information and data to drive a variety of case studies. The Sourcing Simulator™ is used to determine the effect that lead times, forecasting error, product drift and seasonality have on retail performance (i.e. service levels, gross margins and inventory levels) for these case studies. Analysis is performed to attempt to quantify some of these hidden costs. Results show that choosing suppliers with shorter lead times provides significant advantages for basic goods as well as seasonal goods, which in some instances justify using more expensive suppliers in terms of first cost. These advantages take on the form of smaller inventory levels for achieving the same service, as well as minimizing the impact of errors in forecast and product mix for basic goods while increasing margins by using in-season replenishments for seasonal products.}, number={6}, journal={Journal of the Textile Institute}, publisher={Informa UK Limited}, author={Hartman, L. and Joines, J.A. and King, R.E. and Thoney, K.A.}, year={2012}, pages={604–621} } @article{hodge_ross_joines_thoney_2011, title={Adapting lean manufacturing principles to the textile industry}, volume={22}, ISSN={["0953-7287"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-79952662154&partnerID=MN8TOARS}, DOI={10.1080/09537287.2010.498577}, abstractNote={A research project was conducted to determine which lean principles are appropriate for implementation in the textile industry. Lean manufacturing involves a variety of principles and techniques, all of which have the same ultimate goal: to eliminate waste and non-value-added activities at every production or service process in order to give the most satisfaction to the customer. To stay competitive, many US textile manufacturers have sought to improve their manufacturing processes so that they can more readily compete with overseas manufacturers. This study identifies the different tools and principles of lean. The use of lean manufacturing in the textile industry was examined in this research through interviews, plant tours and case studies. A model for implementing lean tools and principles in a textile environment was developed.}, number={3}, journal={Production Planning & Control Special Issue on Challenges in Apparel Production, Planning and Control}, publisher={Informa UK Limited}, author={Hodge, G.L. and Ross, K.G. and Joines, J.A. and Thoney, K.A.}, year={2011}, pages={237–247} } @inproceedings{hamilton_oxenham_hodge_thoney_2010, title={Process and product data management for staple yarn manufacturing}, booktitle={Proceedings of the Centenary Conference 2010 of the Textile Institute}, author={Hamilton, B.J. and Oxenham, W. and Hodge, G.L. and Thoney, K.A.}, year={2010} } @inproceedings{hodge_wagoner_thoney_joines_2008, title={Lean planning and scheduling in textile manufacturing}, booktitle={Proceedings of the 2008 Conference of the Textile Institute}, author={Hodge, G.L. and Wagoner, A.G. and Thoney, K.A. and Joines, J.A.}, year={2008} } @inproceedings{hartman_joines_thoney_king_2008, title={Strategic analysis of speed and flexibility in sourcing textile products}, booktitle={Industrial Simulation Conference 2008}, publisher={EUROSIS}, author={Hartman, L.M. and Joines, J.A. and Thoney, K.A. and King, R.E.}, year={2008} } @article{cho_thoney_krauss_2006, title={A theoretical approach to characterising setups in batch fabric dyeing operations}, volume={122}, ISSN={["1478-4408"]}, DOI={10.1111/j.1478-4408.2006.00021.x}, abstractNote={Traditionally, most of the research published on dyeing has been on achievements in optimising the mechanical and chemical technology associated with the physical dyeing process. However, relatively little research is available in the area of scheduling dyeing operations. This could be due to a lack of information available about dyeing setups. In this study, a theoretical approach to structuring machine‐cleaning setups in batch fabric dyeing operations based on the CIELAB L*C*h colour space and the tolerance of the human visual system is presented. This will permit more research on the detailed scheduling of dyeing operations that could ultimately help dyeing facilities to better meet the needs of their customers in terms of improving on‐time delivery.}, number={3}, journal={COLORATION TECHNOLOGY}, publisher={Wiley}, author={Cho, Eunkyoung G. and Thoney, Kristin A. and Krauss, Jeffrey D.}, year={2006}, pages={145–152} } @article{laoboonlur_hodgson_thoney_2006, title={Production scheduling in a knitted fabric dyeing and finishing process}, volume={97}, DOI={10.1533/joti.2005.0145}, number={5}, journal={Journal of the Textile Institute}, author={Laoboonlur, P. and Hodgson, Thom and Thoney, K. A.}, year={2006}, pages={391–399} } @article{laoboonlur_hodgson_thoney_2006, title={Production scheduling in a knitted fabric dyeing and finishing process}, volume={97}, DOI={10.1533/joti.2006.0145}, abstractNote={Abstract Developing detailed production schedules for dyeing and finishing operations is a very difficult task that has received relatively little attention in the literature. In this paper, a scheduling procedure is presented for a knitted fabric dyeing and finishing plant that is essentially a flexible job shop with sequence-dependent setups. An existing job shop scheduling algorithm is modified to take into account the complexities of the case plant. The resulting approach based on family scheduling is tested on problems generated with case plant characteristics.}, number={5}, journal={Journal of the Textile Institute}, publisher={Informa UK Limited}, author={Laoboonlur, P. and Hodgson, T. J. and Thoney, K. A.}, year={2006}, month={Aug}, pages={391–399} } @inproceedings{joines_thoney_kay_2006, title={Supply chain multi-objective simulation optimization}, ISBN={9789077381267}, booktitle={4th International Industrial Simulation Conference 2006 : ISC'2006 ; June 5 - 7, 2006, Palermo, Italy /}, publisher={Ostend: EUROSIS-ETI}, author={Joines, J.A. and Thoney, K and Kay, M.G}, year={2006}, pages={125–132} } @inproceedings{joines_thoney_martin_2005, title={Development of an inventory management spreadsheet simulator for a large apparel company}, booktitle={Industrial Simulation Conference 2005}, publisher={EUROSIS}, author={Joines, J.A. and Thoney, K.A. and Martin, B.R.}, year={2005} } @inproceedings{joines_martin_thoney_2005, title={Utilizing simple spreadsheet simulators to develop a finished goods inventory model for an apparel company}, ISBN={9789077381182}, booktitle={3rd International Industrial Simulation Conference 2005 : ISC 2005 ; June 9 - 11, 2005, Berlin, Germany}, publisher={Ghent: EUROSIS}, author={Joines, J. A. and Martin, B. and Thoney, K. A.}, year={2005}, pages={417–422} } @inproceedings{joines_thoney_hodgson_king_2004, title={A simulation-based scheduling system and its implementation in a textile operation}, booktitle={Industrial Simulation Conference 2004}, publisher={EUROSIS}, author={Joines, J.A. and Thoney, K.A. and Hodgson, T.J. and King, R.E.}, editor={Marin, J. and Koncar, V.Editors}, year={2004} } @article{schultz_hodgson_king_thoney_2004, title={Minimizing L-max for large-scale, job-shop scheduling problems}, volume={42}, ISSN={["1366-588X"]}, DOI={10.1080/00207540410001721754}, abstractNote={The academic literature in 2000 presented a procedure for solving the job-shop-scheduling problem of minimizing L max. The iterative-adaptive simulation-based procedure is shown here to perform well on large-scale problems. However, there is potential for improvement in closing the gap between best-known solutions and the lower bound. In the present paper, a simulated annealing post-processing procedure is presented and evaluated on large-scale problems. A new neighbourhood structure for local searches in the job-shop scheduling problem is developed. The procedure is also evaluated using benchmark problems and new upper bounds are established.}, number={23}, journal={INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, publisher={Informa UK Limited}, author={Schultz, SR and Hodgson, TJ and King, RE and Thoney, KA}, year={2004}, month={Dec}, pages={4893–4907} } @article{hodgson_melendez_thoney_trainor_2004, place={San Diego}, title={The deployment scheduling analysis tool (DSAT)}, volume={39}, ISSN={0895-7177}, url={http://dx.doi.org/10.1016/s0895-7177(04)90561-4}, DOI={10.1016/s0895-7177(04)90561-4}, abstractNote={The deployment scheduling analysis tool is an analysis tool for studying military deployment scenarios. The tool has a user interface through which the user selects the deploying units, equipment, and their required delivery dates. The user also selects the ports (air, rail, and sea) through which the units will travel to get to the final destination. Finally, the user selects the transportation assets on which the units will travel and assigns those assets to the routes in the deployment network. The system schedules the equipment for deployment by creating individual equipment routings and then repetitively simulating the deployment to determine the deployment closure time and the maximum lateness (Lmax) of any unit. The equipment is scheduled to minimize the maximum lateness of all deploying units. Deployment information is formatted into various graphs and reports. Finally, the user can modify various aspects of the deployment scenario to conduct sensitivity analysis. A valuable option is a heuristic procedure to reassign transportation assets in an attempt to further reduce the deployment closure time and Lmax.}, number={Special Issue on Defense Transportation Algorithms, Models and Applications}, journal={Mathematical and Computer Modeling Journal}, publisher={Elsevier}, author={Hodgson, T.J. and Melendez, B. and Thoney, K.A. and Trainor, T.E.}, editor={Brigantic, R.T. and Mahan, J.M.Editors}, year={2004}, pages={905–924} } @inproceedings{joines_sutton_thoney_king_hodgson_2003, place={New York, N.Y.}, title={Implementing a simulation-based scheduling system for a two-plant operation}, ISBN={9780780381315}, DOI={10.1109/wsc.2003.1261587}, abstractNote={Scheduling any complicated job shop becomes increasingly more difficult when the cycle time is reduced. We discuss the implementation of a simulation-based scheduling system that properly schedules parts in a two-plant operation. The system has allowed the company to reduce the cycle time by at least a week from two/three weeks to one/two weeks. As part of the project, the generation of the input data needed to drive the simulation is also discussed since this data did not exist in the correct form. The model generation, simulation development, and experimentation will be discussed. The system that is described is currently being used to generate the schedules.}, booktitle={Proceedings of the 2003 Winter Simulation Conference: Fairmont Hotel, New Orleans, LA, U.S.A., December 7-10, 2003}, publisher={Association for Computing Machinery}, author={Joines, J.A. and Sutton, A.W. and Thoney, K.A and King, R.E. and Hodgson, T.J.}, year={2003} } @inproceedings{schultz_coley_hodgson_king_thoney_2003, title={Minimizing WIP for job shop problems while satisfying due dates}, booktitle={Proceedings of the 2003 Industrial Engineering Research Conference}, author={Schultz, S.R. and Coley, A.L. and Hodgson, T.J. and King, R.E. and Thoney, K.A.}, year={2003} } @article{cho_thoney_hodgson_king_2003, title={Rolling horizon scheduling of multi-factory supply chains}, ISBN={["0-7803-8131-9"]}, DOI={10.1109/wsc.2003.1261583}, abstractNote={The virtual factory is a job shop scheduling tool that was developed at NC State. It has been found to provide near-optimal solutions to industrial-sized problems in seconds. Recently, the virtual factory was expanded to include interfactory transportation operations, which enabled the detailed scheduling of entire multifactory manufacturing supply chains. Separately, a rolling horizon procedure was developed to test the virtual factory for single factory problems. This procedure allowed us to more accurately predict how the virtual factory would perform in industry. Consequently, the rolling horizon procedure was extended to multifactory settings to gauge industrial performance and eliminate transient effects found in previous multifactory experimentation. Experimental results, under a variety of different scenarios, indicate that the virtual factory also performs well in multifactory, rolling horizon settings.}, journal={PROCEEDINGS OF THE 2003 WINTER SIMULATION CONFERENCE, VOLS 1 AND 2}, publisher={IEEE}, author={Cho, EG and Thoney, KA and Hodgson, TJ and King, RE}, year={2003}, pages={1409–1416} } @article{taner_hodgson_king_thoney_2003, title={Satisfying due-dates in a job shop with sequence-dependent family set-ups}, volume={41}, ISSN={["0020-7543"]}, DOI={10.1080/0020754031000149167}, abstractNote={This paper addresses job shop scheduling with sequence dependent family set-ups. Based on a simple, single-machine dynamic scheduling problem, state dependent scheduling rules for the single machine problem are developed and tested using Markov Decision Processes. Then, a generalized scheduling policy for the job shop problem is established based on a characterization of the optimal policy. The policy is combined with a 'forecasting' mechanism to utilize global shop floor information for local dispatching decisions. Computational results show that performance is significantly better than that of existing alternative policies.}, number={17}, journal={INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, publisher={Informa UK Limited}, author={Taner, MR and Hodgson, TJ and King, RE and Thoney, KA}, year={2003}, month={Nov}, pages={4153–4169} } @article{king_moon_nuttle_thoney_2002, title={Case Study Analysis of Inventory Stocking Policies to Support Replenishment: A Supply-chain Perspective}, volume={93}, ISSN={0040-5000 1754-2340}, url={http://dx.doi.org/10.1080/00405000208658356}, DOI={10.1080/00405000208658356}, abstractNote={Typically, in an attempt to optimize gross margin (revenue minus cost of goods), sourcing decisions for apparel products are based heavily on the lowest cost alternative. This is due to the assumption that the sourcing option does not affect the revenue side of the gross margin calculation, but it does impact the cost of goods. However, a fast, flexible supplier that can provide in-season replenishment can have a significant impact on revenue. Previous research has shown the benefit of including more than simple pre-season bottom line cost measures (e.g. King and Hunter, 1997; King and Maddalena, 1998; King et al., 1999; King, 2001). We present a case study of a manufacturer who hopes to capture the business of a major brand manufacturer who currently buys his product from a low cost, long lead time vendor. The study demonstrates the impact of in-season order replenishment, as well as the raw material inventory strategy, on the performance of a product line (program) for both the supplier and customer, as well as from a supply-chain perspective.}, number={3}, journal={Journal of the Textile Institute}, publisher={Informa UK Limited}, author={King, R. E. and Moon, W. K. and Nuttle, H. L.W and Thoney, K. A.}, year={2002}, month={Jan}, pages={25–35} } @article{king_brain_thoney_2002, title={Control of yarn inventory for a cotton spinning plant, part 1: Uncorrelated demand}, volume={2}, number={2}, journal={Journal of Textile and Apparel Technology and Management}, author={King, R. E. and Brain, L. C. and Thoney, K. A.}, year={2002} } @article{king_brain_thoney_2002, title={Control of yarn inventory for a cotton spinning plant, part 2: Demand correlation and seasonality}, volume={2}, number={2}, journal={Journal of Textile and Apparel Technology and Management}, author={King, R. E. and Brain, L. C. and Thoney, K. A.}, year={2002} } @inproceedings{thoney_hodgson_joines_maninagarajan_2002, place={New York, N.Y.}, title={Rolling horizon scheduling of large job shops}, ISBN={9780780376144}, DOI={10.1109/wsc.2002.1166485}, abstractNote={The Virtual Factory is a job shop scheduling tool that was developed at NC State. It has been shown to provide near-optimal solutions to industrial-sized problems in seconds through comparison to a computed lower bound. It is an iterative simulation-based procedure, whose objective is minimizing maximum lateness. Like many other job shop scheduling tools, the Virtual Factory has been evaluated primarily in a transient setting, even though a rolling horizon setting is more indicative of the situation in which scheduling algorithms are used in industry. Consequently, a rolling horizon procedure has been developed with which the Virtual Factory was tested. Experimental results indicate that the Virtual Factory also performs well under these circumstances.}, booktitle={Proceedings of the 2002 Winter Simulation Conference: Manchester Grand Hyatt San Diego, San Diego, CA, U.S.A., December 8-11, 2002}, publisher={Association for Computing Machinery}, author={Thoney, K.A. and Hodgson, T.J. and Joines, J.A. and Maninagarajan, P.}, year={2002} } @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} } @article{hodgson_king_thoney_stanislaw_weintraub_zozom_2000, title={On satisfying due-dates in large job shops: idle time insertion}, volume={32}, DOI={10.1080/07408170008963890}, abstractNote={We consider the problem of minimizing maximum lateness in a job shop. A conceptually simple simulation based procedure described in a recent paper by Hodgson et al. [1] is modified to provide improved schedules. Computational experimentation is provided to identify the conditions under which the approach is most viable, and to report the procedure's performance on known test problems.}, number={2}, journal={IIE Transactions}, publisher={Informa UK Limited}, author={HODGSON, THOM J. and KING, RUSSELL E. and THONEY, KRISTIN and STANISLAW, NATALIE and WEINTRAUB, ALEXANDER J. and ZOZOM, ANDREW}, year={2000}, month={Feb}, pages={177–180} } @article{elmaghraby_thoney_1999, title={The two-machine stochastic flowshop problem with arbitrary processing time distributions}, volume={31}, DOI={10.1023/A:1007697625481}, abstractNote={We treat the two-machine flowshop problem with the objective of minimizing the expected makespan when the jobs possess stochastic durations of arbitrary distributions. We make three contributions in this paper: (1) we propose an exact approach with exponential worst-case time complexity. We also propose approximations which are computationally modest in their requirements. Experimental results indicate that our procedure is within less than 1% of the optimum; and (2) we provide a more elementary proof of the bounds on the project completion time based on the concepts of 'control networks'; and (3) we extend the 'reverse search' procedure of Avis and Fukuda [1] to the context of permutation schedules.}, number={5}, journal={IIE Transactions}, author={Elmaghraby, S. E. and Thoney, K. A.}, year={1999}, pages={467–477} } @article{elmaghraby_thoney_1999, title={The two-machine stochastic flowshop problem with arbitrary processing time distributions}, volume={31}, DOI={10.1080/07408179908969849}, abstractNote={We treat the two-machine flowshop problem with the objective of minimizing the expected makespan when the jobs possess stochastic durations of arbitrary distributions. We make three contributions in this paper: (1) we propose an exact approach with exponential worst-case time complexity. We also propose approximations which are computationally modest in their requirements. Experimental results indicate that our procedure is within less than 1% of the optimum; and (2) we provide a more elementary proof of the bounds on the project completion time based on the concepts of 'control networks'; and (3) we extend the 'reverse search' procedure of Avis and Fukuda [1] to the context of permutation schedules.}, number={5}, journal={IIE Transactions}, publisher={Informa UK Limited}, author={ELMAGHRABY, SALAH E. and THONEY, KRISTIN A.}, year={1999}, month={May}, pages={467–477} }