Minimization of Delay Costs in the Realization of Production Orders in Two-Machine System

Open access


The article presents a new algorithm that enables the allocation of the optimal scheduling of the production orders in the two-machine system based on the minimum cost of order delays. The formulated algorithm uses the method of branch and bounds and it is a particular generalisation of the algorithm enabling for the determination of the sequence of the production orders with the minimal sum of the delays. In order to illustrate the proposed algorithm in the best way, the article contains examples accompanied by the graphical trees of solutions. The research analysing the utility of the said algorithm was conducted. The achieved results proved the usefulness of the proposed algorithm when applied to scheduling of orders. The formulated algorithm was implemented in the Matlab programme. In addition, the studies for different sets of production orders were conducted.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] R. Cupek A. Ziebinski L. Huczala and H. Erdogan “Agent-based manufacturing execution systems for short-series production scheduling” Computers in Industry vol. 82 pp. 245-258 2016.

  • [2] R. Dylewski A. Jardzioch and I. Krebs “The Optimal Sequence of Production Orders Taking into Account the Cost of Delays” Management and Production Engineering Review vol. 7 no. 2 pp. 21-28 2016.

  • [3] R. Germs N.D. Van Foreest and O.A. Kilc “Optimal policies for production-clearing systems under continuous – review” European Journal of Operational Research vol. 255 no. 3 pp. 747-757 2016.

  • [4] A. Haned A. Soukhal M. Boudhar and N.H. Tuong “Scheduling on parallel machines with preemption and transportation delays” Computers & Operations Research vol. 39 pp. 374-381 2012.

  • [5] A. Jardzioch and R. Dylewski “Determining the minimum sum of production order delays in a two-machine system” Management and Production Engineering Review vol. 8 No. 3 2017.

  • [6] A. Jardzioch J. Jaskowski. „Calculation of the deadlines for nesting with the possibility of combining orders”. Management Systems in Production Engineering no. 1(17) pp. 22-27 2015. (doi: 10.12914/MSPE-04-01-2015)

  • [7] Q. Ji Y. Wang and X. Hu “Optimal production planning for assembly systems with uncertain capacities and random demand” European Journal of Operational Research vol. 253 no. 2 pp. 393-391 2016.

  • [8] V.K. Manupatu G.D. Putnik M.K. Tiwari P. Avila and M. Cruz-Cunha “Integration of process planning and scheduling using mobile-agent based approach in a networked manufacturing environment” Computers & Industrial Engineering vol. 94 pp. 63-73 2016.

  • [9] A. Negahban and J.S. Smith “Simulation for manufacturing system design and operation: Literature review and analysis” Journal of Manufacturing Systems vol. 33 no. 2 pp. 241-261 2014.

  • [10] U. Okongwu M. Lauras J. Francois and J-Ch. Des-champs “Impact of the integration of tactical supply chain planning determinants on performance” Journal of Manufacturing Systems vol. 38 pp. 181-194 2016.

  • [11] R.H. Schmitt M. Ellerich and S. Humphrey “Multi-objective allocation of customized orders to production-line networks” CIRP Annals – Manufacturing Technology vol. 65 no. 1 pp. 429-432 2016.

  • [12] F. Shrouf J. Ordieres-Mere A. Garcia-Sanches and M. Ortega-Mier “Optimizing the production scheduling of a single machine to minimize total energy consumption costs” Journal of Cleaner Production vol. 67 pp. 197-207 2014.

Journal information
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 262 170 2
PDF Downloads 141 108 5