2020 journal article
Improving chemotherapy infusion operations through the simulation of scheduling heuristics: a case study
Health Systems, 2, 1–16.
2020 journal article
Modeling and transportation planning for US noncombatant evacuation operations in South Korea
Journal of Defense Analytics and Logistics, 4(1), 41–69.
2018 journal article
A Military Logistics Network Planning System
Military Operations Research, 23(4), 5–24.
Contributors: M. Rogers, B. McConnell , , M. Kay , R. King , G. Parlier, K. Thoney-Barletta
2017 journal article
A comparison of mixed integer programming formulations of the capacitated lot-sizing problem
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 56(23), 7064–7084.
Contributors: H. Karagul*, D. Warsing n , n , M. Kapadia n & R. Uzsoy n
2017 journal article
Allocation heuristics for high-altitude long- endurance UAV image intelligence platforms
Military Operations Research, 22(3), 5–19.
2015 journal article
On the economic lot scheduling problem: stock-out prevention and system feasibility
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 53(16), 4903–4916.
Contributors: B. Hanson n, n , M. Kay n , R. King n & K. Thoney-Barletta n
2014 journal article
A practical method for evaluating worker allocations in large-scale dual resource constrained job shops
IIE Transactions, 46(11), 1209–1226.
2013 journal article
Allocating job-shop manpower to minimize : Optimality criteria, search heuristics, and probabilistic quality metrics
Computers & Operations Research, 40(10), 2569–2584.
2012 journal article
An effective lower bound on <mml:math altimg="si0041.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>max</mml:mi></mml:mrow></mml:msub></mml:math> in a worker-constrained job shop
Computers & Operations Research, 40(1), 328–343.
2011 journal article
Information sharing in capacity constrained supply chains under lost sales
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 49(24), 7469–7491.
2008 journal article
Technical Note: A Computationally Efficient Algorithm for Undiscounted Markov Decision Processes with Restricted Observations
NAVAL RESEARCH LOGISTICS, 56(1), 86–92.
2006 journal article
Determining sequence and ready times in a remanufacturing system
IIE TRANSACTIONS, 38(7), 597–607.
2006 journal article
Production scheduling in a knitted fabric dyeing and finishing process
Journal of the Textile Institute, 97(5), 391–399.
2006 journal article
Satisfying due-dates in the presence of sequence dependent family setups with a special comedown structure
COMPUTERS & INDUSTRIAL ENGINEERING, 52(1), 57–70.
2004 journal article
A material allocation scheme for optical fibre cable manufacturing: a case study
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 42(16), 3271–3279.
2004 journal article
Minimizing L-max for large-scale, job-shop scheduling problems
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 42(23), 4893–4907.
2004 journal article
Minimizing L-max for the single machine scheduling problem with family set-ups
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 42(20), 4315–4330.
2004 journal article
Scheduling non-similar groups on a flow line: multiple group setups
Robotics and Computer-Integrated Manufacturing, 20(6), 505–515.
2004 journal article
Scheduling non-similar groups on a flow line: multiple group setups
Robotics and Computer-Integrated Manufacturing, 20(6), 505–515.
2004 journal article
The deployment scheduling analysis tool (DSAT)
Mathematical and Computer Modelling, 39(08-Jun), 905–924.
2004 journal article
The deployment scheduling analysis tool (DSAT)
Mathematical and Computer Modelling, 39(6-8), 905–924.
Ed(s): R. Brigantic & J. Mahan
2003 journal article
Integrated job release and shop-floor scheduling to minimize WIP and meet due-dates
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 41(1), 31–45.
2003 journal article
Satisfying due-dates in a job shop with sequence-dependent family set-ups
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 41(17), 4153–4169.
2002 journal article
Satisfying due-dates in large multi-factory supply chains
IIE TRANSACTIONS, 34(9), 803–811.
2001 journal article
Dry-or-buy decision support for dry kiln scheduling in furniture production
IIE Transactions, 33(2), 131–136.
2000 journal article
On satisfying due-dates in large job shops: Idle time insertion
IIE Transactions, 32(2), 177–180.
1999 journal article
Dry kiln scheduling in furniture production
IIE Transactions, 31(8), 733–738.
1999 journal article
Evaluation of cylindricity using combinatorics
IIE Transactions, 31(1), 39–47.
1999 journal article
Scheduling with alternatives: a link between process planning and scheduling
IIE Transactions, 31(11), 1093–1102.
1998 journal article
A fuzzy due-date bargainer for the make-to-order manufacturing systems
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 28(3), 492–497.
1998 journal article
Decision support system for lumber procurement and dry kiln scheduling
Forest Products Journal, 48(9), 51–59.
1998 journal article
Note. Satisfying due dates in large job shops
MANAGEMENT SCIENCE, 44(10), 1442–1446.
1997 journal article
Ready-time scheduling with stochastic service times
OPERATIONS RESEARCH, 45(5), 779–783.
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.