L
Laura Barbulescu
Researcher at Carnegie Mellon University
Publications - 25
Citations - 854
Laura Barbulescu is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Job shop scheduling & Local search (optimization). The author has an hindex of 15, co-authored 24 publications receiving 802 citations. Previous affiliations of Laura Barbulescu include Colorado State University.
Papers
More filters
Journal ArticleDOI
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
TL;DR: The first coupled formal and empirical analysis of the Satellite Range Scheduling application is presented, showing that the simplified version of the problem is equivalent to a well-known machine scheduling problem and it is proved that Satelliterange Scheduling is NP-complete.
Journal ArticleDOI
Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
TL;DR: It is concluded that more realistic, structured permutation flow-shop problems are actually relatively easy to solve, and raises doubts as to whether superior performance on difficult random scheduling problems translates into superiorperformance on more realistic kinds of scheduling problems.
Journal ArticleDOI
AFSCN scheduling: How the problem and solution have evolved
TL;DR: It can be shown that local search (and therefore metaheuristics based on local search) fail to compete with Gooley's algorithm and Genitor and it is suggested that minimizing schedule overlaps makes it easier to fit larger requests into the schedule.
Proceedings Article
Algorithm performance and problem structure for flow-shop scheduling
TL;DR: It is found that, as more realistic characteristics are introduced, the performance of a state-of-the-art algorithm degrades rapidly: faster and less complex stochastic algorithms provide superior performance.
Book ChapterDOI
Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search
TL;DR: Three algorithms are tested on the satellite range scheduling problem, using data from the U.S. Air Force Satellite Control Network; a simple heuristic, as well as local search methods, are compared against a genetic algorithm, which yields the best overall performance on larger, more difficult problems.