What is it about?
This article presents a new algorithm that allows the optimal sequence of production orders to be determined in a two-machine system, based on the minimum sum of delays. The developed algorithm utilizes the methodology of branch and bounds, and takes into account the slack time (permissible order delay not leading to delay costs) following processing on the first machine.
Featured Image
Why is it important?
The algorithm proposed in this paper allows us to find the optimal solutions from the point of view of the sum of delay times in a two-machine system, by utilizing the so-called lack of slack time ratio.
Perspectives
Writing this article was a great pleasure as it has co-author with whom I have had long standing collaborations.
Dr Andrzej Jardzioch
West Pomeranian University of Technolgy Szczecin
Read the Original
This page is a summary of: Determining the Minimum Sum of Production Order Delays in a Two-Machine System, Management and Production Engineering Review, January 2017, De Gruyter,
DOI: 10.1515/mper-2017-0026.
You can read the full text:
Contributors
The following have contributed to this page
