The Prioritisation of Production Orders Under the Bee Colony Algorithm

Jardzioch, Andrzej; Bulwan, Katarzyna

doi:10.2478/amst-2013-0031

Cited by 3 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tabu Search procedure), simulated annealing, immunological algorithms and genetic algorithms (Wang et al, 2013). In the production scheduling there are often used priority rules because of their simple structure and reduced computational complexity (Binchao & Matis, 2013;Jardzioch & Bulwan, 2013). Recently more and more research focus on the problem of robust scheduling to reduce the impact of uncertainties during the optimization process (Paprocka & Skołud, 2013;Cheref et al, 2016;Himmiche et al, 2018).…”

Section: Introductionmentioning

confidence: 99%

Management and Production Engineering Review

Matuszny

2022

View full text Add to dashboard Cite

The article is to present the application of genetic algorithm in production scheduling in a production company. In the research work the assumptions of the methodology were described and the operation of the proposed genetic algorithm was presented in details. Genetic algorithms are useful in complex large scale combinatorial optimisation tasks and in the engineering tasks with numerous limitations in the production engineering. Moreover, they are more reliable than the existing direct search algorithms. The research is focused on the effectivity improvement and on the methodology of scheduling of a manufacturing cell work. The genetic algorithm used in the work appeared to be robust and fast in finding accurate solutions. It was shown by experiment that using this method enables obtaining schedules suitable for a model. It gives a group of solutions that are at least as good as those created by the heuristic rules.

show abstract

Section: Introductionmentioning

confidence: 99%

Management and Production Engineering Review

Matuszny

2022

View full text Add to dashboard Cite

show abstract

“…Evolutionary algorithms, swarm algorithms, simulated annealing algorithms or various types of heuristic rules are often suggested for resolving such problems [8]. These methods allow us to obtain solutions quickly, but their common weakness is the inability to obtain the optimal solution.…”

Section: The Problem Of Scheduling Production Orders Processed On Twomentioning

confidence: 99%

“…They also do not allow us to estimate how far the obtained solution is from the optimal solution. Because of that investigations are being carried out to find a method that would allow to identify the optimal sequence of orders for a given objective function [8][9][10][11].…”

Section: The Problem Of Scheduling Production Orders Processed On Twomentioning

confidence: 99%

Determining the Minimum Sum of Production Order Delays in a Two-Machine System

Jardzioch¹,

Dylewski²

2017

Management and Production Engineering Review

Self Cite

View full text Add to dashboard Cite

One of the main tasks in the planning of production processes is to satisfy the needs of the customers in terms of quantity, quality and time. The issue of the timely execution of production orders is becoming increasingly important. Based on the conducted studies it can be concluded that the size of the delay depends on the adopted scheduling of orders. This paper focuses on the problem of implementing a scheduling of production orders that will allow to avoid delays, and in the event such a scheduling is not possible, for minimizing the sum of delays of all the orders. A new algorithm has been proposed that allows to determine of the optimal sequence of production orders with the minimum sum of delays. The considerations have been limited to the issue of a two-machine system in which the orders are carried out in a flow.

show abstract

The concept of algorithm supporting the process of scheduling production tasks

2018

View full text Add to dashboard Cite

The purpose of the work was to develop a concept of an algorithm which supports the process of scheduling production tasks. The designed algorithm performs a task queue creation process in six steps: selecting a schedule type, declaring a queue length, selecting orders for queue development, loading data, automatic job analysis, and queue and Gantt chart generation, taking a decision on the acceptance of the designed production program. The designed system will use single-attribute priority rules (defined by experts) and multi-attribute rules that can be created by combining single-attribute rules. The concept of an algorithm that supports the process of scheduling production tasks, developed and tested by conducting simulations, can be the basis for developing a computer application supporting decision-making process in a manufacturing or service company.

show abstract

The Prioritisation of Production Orders Under the Bee Colony Algorithm

Cited by 3 publications

References 16 publications

Management and Production Engineering Review

Management and Production Engineering Review

Determining the Minimum Sum of Production Order Delays in a Two-Machine System

The concept of algorithm supporting the process of scheduling production tasks

Contact Info

Product

Resources

About