What is it about?
We suggest a fast and efficient algorithm to schedule cuts in a way compliant with finite intermediate buffer capacities.
Featured Image
Why is it important?
Real industrial cutting processes have finite buffer capacities... therefore you should consider it before solving your cutting problem. If not, the sequence in which you cut items can be infeasible, or simply chaotic. We suggest how to deal with this issue in an efficient way.
Perspectives
There is a lot to do in the area of simultaneous cut-and-schedule
Claudio Arbib
Read the Original
This page is a summary of: An LP-based tabu search for batch scheduling in a cutting process with finite buffers, International Journal of Production Economics, April 2012, Elsevier,
DOI: 10.1016/j.ijpe.2011.12.003.
You can read the full text:
Contributors
The following have contributed to this page
