We consider an interval scheduling problem where n jobs are required to be carried out by m nonidentical machines in an offline-scheduling way. Each job has a starting time, a finishing time and a number of processing units. Every machine has different number of processing units to carry out jobs. A machine can process only one job at a time without interrupted on the condition that the number of its units must satisfy job’s requirement. Further more, all units in one machine consume energy if the machine is powered up. Within this setting, one is asked to find a proper schedule of machines so that the total number of working units is as less as possible. For this interval scheduling problem, we first discuss an exact method based on integer programming which can be solved by branch-and-bound algorithm. Then, we propose two approximated methods named GreedyBS and GreedyMR using greedy strategy. GreedyBS is proved to be a 2.1343-approximated algorithm. All proposed algorithms are tested on a large set of randomly generated instances. It turns out that GreedyBS requires less total units of machines under time constrain when comparing with GreedyMR and exact methods in most cases, while GreedyMR costs the minimum time. Several parameters of GreedyBS and GreedyMR were also evaluated to improve the performances of these two algorithms.
This is a preview of subscription content, log in to check access.
This research is supported by the National Natural Science Foundation of China (Grant No. 71701207), Natural Science Foundation of Hunan Province(Grant No. 2018JJ2477) and the National Defense Science and Technology Project Fund of the Central military commission (Grant No. 3101097).
Jansen, K.: An approximation algorithm for the license and shift class design problem. Eur. J. Oper. Res. 73(1), 127–131 (1994)CrossRefzbMATHGoogle Scholar
Kroon, L.G., Salomon, M., Van Wassenhove, L.N.: Exact and approximation algorithms for the tactical fixed interval scheduling problem. Eur. J. Oper. Res. 82(4), 624–638 (1995)MathSciNetzbMATHGoogle Scholar
Jansen, K.: Approximation Results for the Optimum Cost Chromatic Partition Problem. Springer, Berlin, Heidelberg (1997)CrossRefzbMATHGoogle Scholar
Mhring, R.H.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Cambridge (1980)Google Scholar
Bhatia, R., Chuzhoy, J., Freund, A., Naor, J.S.: Algorithmic aspects of bandwidth trading. ASM Trans. Algorithms 2719(1), 193–193 (2002)zbMATHGoogle Scholar