The Optimal Sequence of Production Orders, Taking Into Account the Cost of Delays

• Autorzy: Robert Dylewski , Andrzej Jardzioch , Irene Krebs
• Języki publikacji: EN

Abstrakty

EN

In flexible manufacturing systems the most important element in determining the proper course of technological processes, transport and storage is the control and planning subsystem. The key planning task is to determine the optimal sequence of production orders. This paper proposes a new method of determining the optimal sequence of production orders in view of the sum of the costs related to the delayed execution of orders. It takes into account the different unit costs of delays of individual orders and the amount of allowable delays of orders involving no delay costs. The optimum sequence of orders, in the single-machine problem, in view of the sum of the costs of delays may be significantly different from the optimal order, taking into account the sum of delay times. (original abstract)

Słowa kluczowe

EN

Production control; Task scheduler; Optimalization

PL

Kontrola produkcji; Harmonogram zadań; Optymalizacja

• Czasopismo: Management and Production Engineering Review
• Rocznik: 2016
• Tom: 7
• Numer: nr 2
• Strony: 21--28

Twórcy

autor

Robert Dylewski

• University of Zielona Gora, Poland

autor

Andrzej Jardzioch

• West Pomeranian University of Technology Szczecin, Poland

autor

Irene Krebs

• Brandenburg University of Technology Cottbus-Senftenberg, Germany

Bibliografia

• [1] Cheng Li, Weimin Wu, Yiping Feng, Gang Rong, Scheduling FMS problems with heuristic search function and transition-timed Petri nets, Journal of Manufacturing, 26, 5, 933-944, 2015.
• [2] Hang Lei, Keyi Xing, Libin Han, Fuli Xiong, Zhaoqiang Ge, Deadlock-free scheduling for flexible manufacturing systems using Petri nets and heuristic search, Computers and Industrial Engineering, 72, 297-305, 2014.
• [3] Lekurwale R.R., Akarte M.M., Raut D.N., Framework to evaluate manufacturing capability using analytical hierarchy process, The International Journal of Advanced Manufacturing Technology, 76, 1, 565576, 2015.
• [4] Giglio D., Minciardi R., Sacone S., Siri S., Optimal Control of Production Processes with Variable Execution Times, Discrete Event Dynamic Systems, 19, 3, 423- 448, 2009.
• [5] Yandong Guo, Min Huang, Qing Wang, Jorge L.V., Single-machine rework rescheduling to minimize maximum waiting-times with fixed sequence of jobs and ready times, Computers and Industrial Engineering, 91, 265- 273, 2016.
• [6] Lan C.-H., The design of multiple production lines under deadline constraint, Int. Journal of Production Economics, 106, 191-203, 2007.
• [7] Kejun Zhao, Xiwen Lu, Manzhan Gu, A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines, Journal of Scheduling, 19, 1, 21-31, 2016.
• [8] Dylewski R., Jardzioch A., Scheduling production orders, taking into account delays and waste, Management and Production Engineering Review, 5, 3, 3-8, 2014.
• [9] Lin-Hui Sun, Lin-Yan Sun, Ming-Zheng Wang, Ji-Bo Wang, Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines, Int. J. International Journal of Production Economics, 138, 195-200, 2012.
• [10] Wang J.-B., Ng C.T., Cheng T.C.E, Liu L.-L., Single machine scheduling with a time-dependent learning effect, International Journal of Production Economics, 111, 2, 802-811, 2008.
• [11] Moshelov G. Serig A, Sidney J., The Browne-Yechiali single machine sequence is optimal for flow-shops, Computers and Operational Research, 37, 11, 1965-1967, 2010.
• [12] Mahnama M., Moslehib G., Ghomia S.M.T.F., Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness, Mathematical and Computer Modelling, 57, 9-10, 2549-2563, 2013.

Identyfikatory

DOI

10.1515/mper-2016-0013