World's Best Scientists 2026 revealed!
J. Christopher Beck

J. Christopher Beck

D-Index & Metrics

Computer Science

D-Index
38
Citations
5075
World Ranking
10368
National Ranking
415

Overview

J. Christopher Beck is a researcher affiliated with the University of Toronto in Canada, focusing primarily on the fields of Computer Science and Engineering. Their work encompasses a broad range of topics within these disciplines, with a substantial number of publications contributing to both theoretical and applied aspects of artificial intelligence and optimization.

Their research spans several main topics, including:

  • AI-based Problem Solving and Planning
  • Constraint Satisfaction and Optimization
  • Scheduling and Optimization Algorithms
  • Vehicle Routing Optimization Methods
  • Robotic Path Planning Algorithms
  • Formal Methods in Verification
  • Metaheuristic Optimization Algorithms Research

Beck's subfields of study include Artificial Intelligence, Industrial and Manufacturing Engineering, Computer Networks and Communications, Computational Theory and Mathematics, and Computer Vision and Pattern Recognition. These areas reflect a multidisciplinary approach that supports both algorithmic development and practical implementation.

They have published extensively in a variety of venues, with frequent contributions to:

  • Proceedings of the International Conference on Automated Planning and Scheduling
  • arXiv (Cornell University)
  • INFORMS Journal on Computing
  • Proceedings of the International Symposium on Combinatorial Search
  • Proceedings of the AAAI Conference on Artificial Intelligence

Recent papers by J. Christopher Beck include:

  • "A Hybrid Quantum-Classical Approach to Solving Scheduling Problems" (2021, Proceedings of the International Symposium on Combinatorial Search)
  • "Target Search on Road Networks With Range-Constrained UAVs and Ground-Based Mobile Recharging Vehicles" (2020, IEEE Robotics and Automation Letters)
  • "Decision Diagrams for Discrete Optimization: A Survey of Recent Advances" (2022, INFORMS Journal on Computing)
  • "Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware" (2022, Proceedings of the International Conference on Automated Planning and Scheduling)
  • "LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions" (2021, Proceedings of the International Conference on Automated Planning and Scheduling)

The scientist frequently collaborates with other researchers, including Ryo Kuroiwa, Margarita P. Castro, Chiara Piacentini, André A. Ciré, and Alexander Shleyfman. These collaborations indicate active engagement in research communities focused on automated planning, optimization, and scheduling.

Best Publications

  • Mixed Integer Programming models for job shop scheduling

    Wen-Yang Ku;J. Christopher Beck

  • Slack-Based Techniques for Robust Schedules

    Andrew J. Davenport;Christophe Gefflot;J. Christopher Beck

  • Problem difficulty for tabu search in job-shop scheduling

    Jean-Paul Watson;J. Christopher Beck;Adele E. Howe;L. Darrell Whitley

  • Improved non-deterministic planning by exploiting state relevance

    Christian Muise;Sheila A. McIlraith;J. Christopher Beck

  • Dsharp: fast d-DNNF compilation with sharpSAT

    Christian Muise;Sheila A. McIlraith;J. Christopher Beck;Eric I. Hsu

  • Wind farm layout optimization on complex terrains – Integrating a CFD wake model with mixed-integer programming

    Jim Y.J. Kuo;David A. Romero;J. Christopher Beck;Cristina H. Amon

  • Decomposition Methods for the Parallel Machine Scheduling Problem with Setups

    Tony T. Tran;Arthur Araujo;J. Christopher Beck

  • A theoretic and practical framework for scheduling in a stochastic environment

    Julien Bidot;Thierry Vidal;Philippe Laborie;J. Christopher Beck

  • Proactive algorithms for job shop scheduling with probabilistic durations

    J. Christopher Beck;Nic Wilson

  • Combining Constraint Programming and Local Search for Job-Shop Scheduling

    J. Christopher Beck;T. K. Feng;Jean-Paul Watson

  • Vehicle routing and job shop scheduling: what's the difference?

    J. Christopher Beck;Patrick Prosser;Evgeny Selensky

  • Constraint-directed techniques for scheduling alternative activities

    J. Christopher Beck;Mark S. Fox

  • Texture-based heuristics for scheduling revisited

    J. Christopher Beck;Andrew J. Davenport;Edward M. Sitarski;Mark S. Fox

  • APPLYING MACHINE LEARNING TO LOW‐KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS

    Tom Carchrae;J. Christopher Beck

  • A Hybrid Quantum-Classical Approach to Solving Scheduling Problems

    Tony T. Tran;Minh Do;Eleanor Gilbert Rieffel;Jeremy Frank

  • Scheduling with uncertain durations: Modeling β-robust scheduling with constraints

    Christine Wei Wu;Kenneth N. Brown;J. Christopher Beck

  • A Hybrid Approach to Scheduling with Earliness and Tardiness Costs

    J. Christopher Beck;Philippe Refalo

  • Solution-guided multi-point constructive search for job shop scheduling

    J. Christopher Beck

  • Planning modulo theories: extending the planning paradigm

    Peter Gregory;Derek Long;Maria Fox;J. Christopher Beck

  • Dynamic optimization of chemotherapy outpatient scheduling with uncertainty

    Shoshana Hahn-Goldberg;Michael W. Carter;J. Christopher Beck;Maureen Trudeau

Frequent Co-Authors

Mark S. Fox
Mark S. Fox University of Toronto
Sheila A. McIlraith
Sheila A. McIlraith University of Toronto
Eugene C. Freuder
Eugene C. Freuder University College Cork
Michael Gruninger
Michael Gruninger University of Toronto
Jean-Paul Watson
Jean-Paul Watson Lawrence Livermore National Laboratory
Eleanor Rieffel
Eleanor Rieffel Ames Research Center
Mark Chignell
Mark Chignell University of Toronto
Scott Sanner
Scott Sanner University of Toronto
Derek Long
Derek Long King's College London
Gary F. Marcus
Gary F. Marcus New York University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Planning to study Computer Science in the USA? Exploring alternative degree options and flexible programs can open new career pathways. Many students begin their journey with an online associate degree. These programs are affordable, take less time to complete, and provide foundational skills that transfer easily to bachelor's programs or entry-level IT roles.

For those aiming for advanced positions, it’s helpful to know which master's degree is most in demand in usa. Degrees like Computer Science and Data Science are highly valued by employers, and online master's programs make it easier for working professionals to upskill.

Cost is often a major concern. Thankfully, there are plenty of affordable online courses that allow you to learn without breaking the bank. Some institutions also make it possible for those with less-than-perfect grades to pursue higher education through a college that accepts low gpa.

With these options, students of all backgrounds and abilities can find flexible and accessible routes to a rewarding career in Computer Science.

Best Scientists Citing J. Christopher Beck

Trending Scientists