@misc{Liu_Xinbo_Exact,
 author={Liu, Xinbo and Wang, Wen and Chen, Xin and Sterna, Małgorzata and Blazewicz, Jacek},
 howpublished={online},
 publisher={Zielona Góra: Uniwersytet Zielonogórski},
 language={eng},
 abstract={We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.},
 type={artykuł},
 title={Exact approaches to late work scheduling on unrelated machines},
 keywords={late work scheduling, unrelated machines, mathematical model, branch-and-bound algorithm, dynamic programming},
}