资源分类
》 资源 》论文》A Branch-And-Price Algorithm for Scheduling Observations on a Telescope

A Branch-And-Price Algorithm for Scheduling Observations on a Telescope

2019-11-22 | |  43 |   39 |   0
Abstract We address a parallel machine scheduling problem for which the objective is to maximize the weighted number of scheduled tasks, and with the special constraint that each task has a mandatory processing instant. This problem arises, in our case, to schedule a set of astronomical observations on a telescope. We prove that the problem is NP-complete, and we propose a constraintprogramming-based branch-and-price algorithm to solve it. Experiments on real and realistic datasets show that the method provides optimal solutions very efficiently.

上一篇：Maintaining Evolving Domain Models

下一篇：Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...