Abstract
In this paper the problem of minimizing total flowtime and number of tardy jobs on a single machine is considered. Some properties of the nondominated solutions are discussed. Computational results on the usefulness of developed properties for problems having up to 30 jobs are reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have