What is it about?

This conference paper considers a single machine scheduling problem with given release and due dates and the minimization of maximum lateness. We consider the special case of this NP-hard problem when the maximim processing time is bounded by a constant and give a polynomial-time algorithm for this case.

Featured Image

Read the Original

This page is a summary of: A polynomially solvable case of a single machine scheduling problem when the maximal job processing time is a constant, IFAC Proceedings Volumes, May 2012, Elsevier, DOI: 10.3182/20120523-3-ro-2023.00053.
You can read the full text:

Read

Contributors

The following have contributed to this page