What is it about?
A single machine problem with a generalized objective function is considered. For two special cases, pseudopolynomial algorithms and their graphical modifications are presented. Computational results are given for problems with up to 50 jobs.
Featured Image
Read the Original
This page is a summary of: A note on a single machine scheduling problem with generalized total tardiness objective function, Information Processing Letters, January 2012, Elsevier,
DOI: 10.1016/j.ipl.2011.10.013.
You can read the full text:
Contributors
The following have contributed to this page
