Publications
- Weak and strong machine dominance in a nonpreemtive flowshop +32005 | Faculty of Mathematics and Physics
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs2002 | Publication without faculty affiliation
- Nonpreemptive flowshop scheduling with machine dominance2002 | Publication without faculty affiliation
- Note: On the Two-Machine No-Idle Flowshop Problem2000 | Faculty of Mathematics and Physics
- Single machine scheduling with fuzzy due dates1997 | Faculty of Mathematics and Physics
- Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates1997 | Faculty of Mathematics and Physics
- Optimal Starting Times for a Class of Single Machine Scheduling Problems with Earliness and Tardiness Penalties1997 | Faculty of Mathematics and Physics
- Weak and Strong Machine Dominance in a Nonpreemptive FlowshopPublication without faculty affiliation
- Nonpreemptive flowshops with a dominant machine: Reductions to single machine problemsPublication without faculty affiliation
- Minimizing total completion time in a two-machine no-idle flowshopPublication without faculty affiliation
Loading network view...