//-->
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2018)
Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, İbrahim, (2020)
Smoothed analysis of the 𝜅-swap neighborhood for makespan scheduling
Rohwedder, Lars, (2025)
Integer preemptive scheduling on parallel machines
Baptiste, Philippe, (2012)
An exact solution with an improved running time for the routing flow shop problem with two machines
Chernykh, Ilya, (2024)
THE ECONOMIC NATURE OF INTELLECTUAL CAPITAL
Gavkalova, N., (2015)