Cynthia Barnhart

Cynthia Barnhart

Auto-generated profile, based on publicly available information

Cynthia Barnhart

Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 February 2006
Verified
Book Chapter
Closed access
PDF file
CBCynthia Barnhart
Cynthia Barnhart
Amy CohnAmy Cohn
Amy Cohn
EJEllis L. Johnson
Ellis L. Johnson
DKDiego Klabjan
Diego Klabjan
GNGeorge L. Nemhauser
George L. Nemhauser
PVPamela H. Vance
Pamela H. Vance

1 October 2018 in Transportation Science
Verified
Journal Article
Open access
VGV. Galle
V. Galle
VMV. H. Manshadi
V. H. Manshadi
SBS. Borjian Boroujeni
S. Borjian Boroujeni
CBC. Barnhart
C. Barnhart
PJP. Jaillet
P. Jaillet
The container relocation problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. However, the assumption of knowing the full retrieval order of containers is particularly unrealistic in real operations. This paper studies the stochastic CRP, which relaxes this assumption. A new multistage stochastic model, called the batch model, is introduced, motivated, and compared with an existing model (the online model). The two main contributions are an optimal algorithm called Pruning-Best-First-Search (PBFS) and a randomized approximate algorithm called PBFS-Approximate with a bounded average error. Both algorithms, applicable in the batch and online models, are based on a new family of lower bounds for which we show some theoretical properties. Moreover, we introduce two new heuristics outperforming the best existing heuristics. Algorithms, bounds, and heuristics are tested in an extensive computational section. Finally, based on strong computational evidence, we conjecture the optimality of the “leveling” heuristic in a special “no information” case, where, at any retrieval stage, any of the remaining containers is equally likely to be retrieved next. The online appendix is available at https://doi.org/10.1287/trsc.2018.0828 .

1 March 2022 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
CBCynthia Barnhart
Cynthia Barnhart
DBDimitris Bertsimas
Dimitris Bertsimas
ADArthur Delarue
Arthur Delarue
JYJulia Yan
Julia Yan
Problem definition: Physical distancing requirements during the COVID-19 pandemic have dramatically reduced the effective capacity of university campuses. Under these conditions, we examine how to make the most of newly scarce resources in the related problems of curriculum planning and course timetabling. Academic/practical relevance: We propose a unified model for university course scheduling problems under a two-stage framework and draw parallels between component problems while showing how to accommodate individual specifics. During the pandemic, our models were critical to measuring the impact of several innovative proposals, including expanding the academic calendar, teaching across multiple rooms, and rotating student attendance through the week and school year. Methodology: We use integer optimization combined with enrollment data from thousands of past students. Our models scale to thousands of individual students enrolled in hundreds of courses. Results: We projected that if Massachusetts Institute of Technology moved from its usual two-semester calendar to a three-semester calendar, with each student attending two semesters in person, more than 90% of student course demand could be satisfied on campus without increasing faculty workloads. For the Sloan School of Management, we produced a new schedule that was implemented in fall 2020. The schedule allowed half of Sloan courses to include an in-person component while adhering to safety guidelines. Despite a fourfold reduction in classroom capacity, it afforded two thirds of Sloan students the opportunity for in-person learning in at least half their courses. Managerial implications: Integer optimization can enable decision making at a large scale in a domain that is usually managed manually by university administrators. Our models, although inspired by the pandemic, are generic and could apply to any scheduling problem under severe capacity constraints.

11 November 2024 in INFORMS Journal on Optimization
Verified
Journal Article
Closed access
CBCynthia Barnhart
Cynthia Barnhart
AJAlexandre Jacquillat
Alexandre Jacquillat
ASAlexandria Schmid
Alexandria Schmid
The rapid deployment of robotics technologies requires dedicated optimization algorithms to manage large fleets of autonomous agents. This paper supports robotic parts-to-picker operations in warehousing by optimizing order–workstation assignments, item–pod assignments, and the schedule of order fulfillment at workstations. The model maximizes throughput, managing human workload at the workstations and congestion in the facility. We solve it via large-scale neighborhood search with a novel learn-then-optimize approach to subproblem generation. The algorithm relies on an off-line machine learning procedure to predict objective improvements based on subproblem features and an online optimization model to generate a new subproblem at each iteration. In collaboration with Amazon Robotics, we show that our model and algorithm generate much stronger solutions for practical problems than state-of-the-art approaches. In particular, our solution enhances the utilization of robotic fleets by coordinating robotic tasks for human operators to pick multiple items at once and by coordinating robotic routes to avoid congestion in the facility. Funding: This research was partially funded by Amazon.com Services LLC under award number 2D-12552417. Supplemental Material: The online appendix is available at https://doi.org/10.1287/ijoo.2024.0033 .