![]() Because there are many stars to observe and few telescopes, astrophysicists want to schedule their telescopes efficiently for star observations. We call the problem the inverse interval scheduling via reduction, or IISR.Ī motivation for IISR comes from astrophysics and the search for exoplanets (Lagrange et al., 2016). The objective is to minimize the total reduction cost. Among various possible ways of modification, we assume each interval can be reduced to its subinterval with a cost proportional to the reduced length. In the inverse interval scheduling problem, we are given a set of machines and the objective is to modify the intervals of the jobs with a least cost so that all jobs with positive processing times may be assigned to the machines. ![]() The objective is to minimize the number of machines that accommodates all jobs. A job can be carried out by at most one machine at a time and no machine can process more than one job at a time. The forward interval scheduling problem is defined as follows: there are a number of nonpreemptive jobs to be scheduled, each represented by an interval with fixed starting and finishing times. ![]() ![]() ![]() This paper considers an inverse version of the interval scheduling problem. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |