- Weak and strong machine dominance in a nonpreemtive flowshop +32005 | Faculty of Mathematics and Physics
- Note: On the Two-Machine No-Idle Flowshop Problem2000 | Faculty of Mathematics and Physics
- Nonpreemptive flowshop scheduling with machine dominance2002 | Publication without faculty affiliation
- Weak and Strong Machine Dominance in a Nonpreemptive FlowshopPublication without faculty affiliation
- Nonpreemptive Flowshop Scheduling with Machine DominancePublication without faculty affiliation
- Minimizing total completion time in a two-machine no-idle flowshopPublication without faculty affiliation
- Nonpreemptive flowshops with a dominant machine: Reductions to single machine problemsPublication without faculty affiliation