Mathematical Modeling of Production Scheduling Problem: A Case Study for Manufacturing Industry (original) (raw)
Related papers
Production scheduling for a job shop using a mathematical model
Contemporary Engineering Sciences
Today, all organizations are continually seeking to produce high quality, reliable, and timely goods and services that meet the needs of their customers. Therefore, production scheduling is one of the most complex activities in production management in organizations. In the present work, the production projection is developed in a Job Shop system using a mathematical model of linear integer programming whose objective is to minimize the total lateness. The developed model is validated by means of an application case with three jobs and four machines, obtaining the optimum programming according to the requirements. The results obtained have been compared with a scheduling software to evaluate the performance of the proposed model.
A Mathematical Model for Production Planning and Scheduling in a Production System: A Case Study
2019
Integration in decision making at different organizational and time levels has important implications for increasing the profitability of organizations. Among the important issues of medium-term decision-making in factories, are production planning problems that seek to determine the quantities of products produced in the medium term and the allocation of corporate resources. Furthermore, at short-term, jobs scheduling and timely delivery of orders is one of the vital decision-making issues in each workshop. In this paper, the production planning and scheduling problem in a factory in the north of Iran is considered as a case study. The factory produces cans and bins in different types with ten production lines. Therefore, a mixed integer linear programming (MILP) model is presented for the integrated production planning and scheduling problem to maximize profit. The proposed model is implemented in the GAMS software with the collected data from the real environment, and the optimal...
Applied Sciences
The overwhelming majority of methodologies for the flexible flow shop scheduling problem proposed so far have a common feature, which is the assumption of constant time and cost for the execution of individual technological operations (ignoring an optimal selecting combination of individual employees and tools). Even if the existence of the influence of the selection of production resources on the course of operations is signaled in the available works, the research so far has not focused on the measurable effect of such a solution that takes into account this phenomenon in scheduling. The proposed production scheduling methodology, including the influence of employees and tools, turned out to be more effective in terms of minimizing the maximum completion time and the cost of the production process compared to existing solutions. The efficiency of the new proposed scheduling methodology was assessed using examples of four technological processes. The research was carried out on the...
Production planning and scheduling optimization model: a case of study for a glass container company
Annals of Operations Research, 2018
Based on a case study, this paper deals with the production planning and scheduling problem of the glass container industry. This is a facility production system that has a set of furnaces where the glass is produced in order to meet the demand, being afterwards distributed to a set of parallel molding machines. Due to huge setup times involved in a color changeover, manufacturers adopt their own mix of furnaces and machines to meet the needs of their customers as flexibly and efficiently as possible. In this paper we proposed an optimization model that maximizes the fulfillment of the demand considering typical constraints from the planning production formulation as well as real case production constraints such as the limited product changeovers and the minimum run length in a machine. The complexity of the proposed model is assessed by means of an industrial real life problem.
A Novel Method Based on Artificial Neural Network to Production Scheduling
The job shop scheduling problem is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to design and develop a job shop scheduling system (a scheduling software) that can generate effective job shop schedules using the multi-layered perceptron (MLP) networks. A method for organizing sample data has been developed using a de- notation bit to indicate processing sequence and processing time of a job simultaneously. The BP training process has been used to control local minimal solutions. Additionally, a heuristics has been suggested to improve and revise the initial production schedule. The proposed production activity schedule system is tested in a real production environment and simulation results show that the proposed model and algorithm are effective. Keyword: Job shop scheduling, Multi-layered perceptron (MLP), Production planning
Optimization by Heuristic procedure of Scheduling Constraints in Manufacturing System
This article provides an insight for optimization the output considering combinations of scheduling constraints by using simple heuristic for multi-product inventory system. Method so proposed is easy to implement in real manufacturing situation by using heuristic procedure machines are arranged in optimal sequence for multiple product to manufacture. This reduces manufacturing lead-time thus enhance profit.
11.Optimization by Heuristic procedure of Scheduling Constraints in Manufacturing System
This article provides an insight for optimization the output considering combinations of scheduling constraints by using simple heuristic for multi-product inventory system. Method so proposed is easy to implement in real manufacturing situation by using heuristic procedure machines are arranged in optimal sequence for multiple product to manufacture. This reduces manufacturing lead-time thus enhance profit.
A short term production planning and scheduling model
Engineering Costs and Production Economics, 1989
An optimal' derision making model is developed to assist the manufacturer to select among the potentiaI customer orders, which orders to reject and which orders to accept and in what quantities such that the net operational profit during the planning time horizon will be maximized. This model is developed based on the group technology concept and assumes that (i) job splitting is allowed, (ii) all the necessary stages of operation of each job (e.g., a batch of identical parts with a specified due date, avuiIability
Solving the problem of scheduling the production process based on heuristic algorithms
JUCS - Journal of Universal Computer Science, 2022
The paper deals with a production scheduling process, which is a problematic and it requires considering a lot of various factors while making the decision. Due to the specificity of the production system analysed in the practical example, the production scheduling problem was classified as a Job-shop Scheduling Problem (JSP). The production scheduling process, especially in the case of JSP, involves the analysis of a variety of data simultaneously and is well known as NP-hard problem. The research was performed in partnership with a company from the automotive industry. The production scheduling process is a task that is usually performed by process engineers. Thus, it can often be affected by mistakes of human nature e.g. habits, differences in experience and knowledge of engineers (their know-how), etc. The usage of heuristic algorithms was proposed as the solution. The chosen methods are genetic and greedy algorithms, as both of them are suitable to resolve a problem that requir...
Production Planning and Scheduling Optimization Model for glass industry
Based on a case study, this paper deals with the production planning and scheduling problem of the glass container industry. This is a facility production system that has a set of furnaces where the glass is produced in order to meet the demand, being afterwards distributed to a set of parallel molding machines. Due to huge setup times involved in a color changeover, manufacturers adopt their own mix of furnaces and machines to meet the needs of their customers as flexibly and efficiently as possible. In this paper we proposed an optimization model that maximizes the fulfillment of the demand considering typical constraints from the planning production formulation as well as real case production constraints such as the limited product changeovers and the minimum run length in a machine. The complexity of the proposed model is assessed by means of an industrial real instance.