The following publications are possibly variants of this publication:
- A combined tree growing technique for block-test scheduling under power constraintsV. Muresan, Xiaojun Wang, Mircea Vladutiu. iscas 2001: 255-258 [doi]
- The Left Edge Algorithm and the Tree Growing Technique in Block-Test Scheduling under Power ConstraintsValentin Muresan, Xiaojun Wang, Valentina Muresan, Mircea Vladutiu. vts 2000: 417-422 [doi]
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraintsKameng Nip, Zhenbo Wang. scheduling, 26(6):543-558, December 2023. [doi]
- Greedy Tree Growing Heuristics on Block-Test Scheduling Under Power ConstraintsValentin Muresan, Xiaojun Wang, Valentina Muresan, Mircea Vladutiu. et, 20(1):61-78, 2004. [doi]
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow timeTianyu Wang, Odile Bellenguez-Morineau. scheduling, 22(6):709-714, 2019. [doi]