What is it about?

This very short note gives a clarification to an earlier paper by the authors in the same journal (see Mathematical Social Sciences, Vol. 62, No.1, 2011, 7-13)

Featured Image

Read the Original

This page is a summary of: A note on the paper ‘Single machine scheduling problems with financial resource constraints: Some complexity results and properties’ by E.R. Gafarov et al., Mathematical Social Sciences, May 2013, Elsevier,
DOI: 10.1016/j.mathsocsci.2012.11.004.
You can read the full text:

Read

Contributors

The following have contributed to this page