Production Planning Problem with Work Completion Time Uncertainty

Abstract

Planning is a prerequisite for improving the industrial efficiency of any production. The main tasks in planning are to minimize time and total costs. The efficiency of equipment utilization depends on workflow management of certain types of machine fleet in the production of multi-item products. Skilled planning reduces costs of raw material and componentrelocation and stacking. One of the important issues is the production scheduling for the following process flow. There are several types of equipment or machines. Machines can operate in parallel. There may be several machines of the same type. The equipment is used to process some items or parts of various types. Each part takesspecific time to be processed on a particular machine type. In addition, according to the manufacturing process technology, there is a sequence of operations on a particular machine type for each part. A machine can process only one partat a time. Limited stacking placefor the parts to be processed may become an extra condition. The article sets the schedulingtask for a given number of different contentworks processingon a given sequence of machines of different types. A machine refers to any device used to perform a process operation related to the operation. Each product or work has an individual sequence of technological operations. The possibility of componentparallel processing in batches intended for the assembly of different products is taken into account withtime uncertainty in the task is allowed. To solve the problem of minimizing finite time, a genetic algorithm is used with the representation of the chromosome in the form of a Petri network. The calculations showed that uncertainties lead to an increase in the release time of products.