What is it about?
Complex tasks often consist of many operations. There are situations in which operations are shared among tasks in such a way that, once an operation is done, it is done for all the tasks that require it. Examples come from material cutting, disassembly of mechanical parts, maintenance of complex systems, network recovery. We here deal with the problem of organizing operations so that a minimum number of the related tasks is eventually late.
Featured Image
Why is it important?
First, because this problem is relevant but, so far, has not been satisfactorily addressed. Secondly, because the method we propose to solve it is quite efficient for up to 80-100 operations and tasks.
Perspectives
An interesting perspective is methodological: other formulations than the one used here can be proposed, and we are curious to know if there is room for improvement. Also, the model could be modified to treat other goals than the number of tardy jobs; or extended to deal with non-unit processing times; or... Well, I believe that the applications addressed by this model should deserve the interest of practitioners and researchers.
Claudio Arbib
Read the Original
This page is a summary of: Sorting common operations to minimize the number of tardy jobs, Networks, November 2014, Wiley,
DOI: 10.1002/net.21576.
You can read the full text:
Contributors
The following have contributed to this page
