scholarly journals Defining accurate delivery dates in make to order job-shops managed by workload control

Author(s):  
Davide Mezzogori ◽  
Giovanni Romagnoli ◽  
Francesco Zammori

Abstract Workload control (WLC) is a lean oriented system that reduces queues and waiting times, by imposing a cap to the workload released to the shop floor. Unfortunately, WLC performance does not systematically outperform that of push operating systems, with undersaturated utilizations levels and optimized dispatching rules. To address this issue, many scientific works made use of complex job-release mechanisms and sophisticated dispatching rules, but this makes WLC too complicated for industrial applications. So, in this study, we propose a complementary approach. At first, to reduce queuing time variability, we introduce a simple WLC system; next we integrate it with a predictive tool that, based on the system state, can accurately forecast the total time needed to manufacture and deliver a job. Due to the non-linearity among dependent and independent variables, forecasts are made using a multi-layer-perceptron; yet, to have a comparison, the effectiveness of both linear and non-linear multi regression model has been tested too. Anyhow, if due dates are endogenous (i.e. set by the manufacturer), they can be directly bound to this internal estimate. Conversely, if they are exogenous (i.e. set by the customer), this approach may not be enough to minimize the percentage of tardy jobs. So, we also propose a negotiation scheme, which can be used to extend exogenous due dates considered too tight, with respect to the internal estimate. This is the main contribution of the paper, as it makes the forecasting approach truly useful in many industrial applications. To test our approach, we simulated a 6-machines job-shop controlled with WLC and equipped with the proposed forecasting system. Obtained performances, namely WIP levels, percentage of tardy jobs and negotiated due dates, were compared with those of a set classical benchmark, and demonstrated the robustness and the quality of our approach, which ensures minimal delays.

Author(s):  
Guido Vinci Carlavan ◽  
Daniel Alejandro Rossit

Industry 4.0 proposes the incorporation of information technologies at all levels of the production process. By incorporating these technologies, Industry 4.0 provides new tools for production planning processes, allowing to address problems in an innovative and efficient manner. From these technologies and tools, it is that in this work a One-of-a-Kind Production (OKP) process is approached, where the products tend to be highly customized. OKP implies working with a very large variability within production, demanding very efficient planning systems. For this, a planning model based on CONWIP-type strategies was proposed, which seeks to level the production of a shop floor configured in the form of a job shop. Even more, for having a more realistic shop-floor representation, machine failures have been included in the model. In turn, different dispatching rules were proposed to study the performance and analyze the behaviour of the system. From the results obtained, it is observed that, when the production demand is very exigent in relation with the capacity of the system, the dispatching rules that analyze the workload generated by each job tend to perform better. However, when the demand on the capacity of the production system is less intense, the rules associated with due dates are the ones that obtain the best results.


Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4836
Author(s):  
Liping Zhang ◽  
Yifan Hu ◽  
Qiuhua Tang ◽  
Jie Li ◽  
Zhixiong Li

In modern manufacturing industry, the methods supporting real-time decision-making are the urgent requirement to response the uncertainty and complexity in intelligent production process. In this paper, a novel closed-loop scheduling framework is proposed to achieve real-time decision making by calling the appropriate data-driven dispatching rules at each rescheduling point. This framework contains four parts: offline training, online decision-making, data base and rules base. In the offline training part, the potential and appropriate dispatching rules with managers’ expectations are explored successfully by an improved gene expression program (IGEP) from the historical production data, not just the available or predictable information of the shop floor. In the online decision-making part, the intelligent shop floor will implement the scheduling scheme which is scheduled by the appropriate dispatching rules from rules base and store the production data into the data base. This approach is evaluated in a scenario of the intelligent job shop with random jobs arrival. Numerical experiments demonstrate that the proposed method outperformed the existing well-known single and combination dispatching rules or the discovered dispatching rules via metaheuristic algorithm in term of makespan, total flow time and tardiness.


2019 ◽  
Vol 18 (01) ◽  
pp. 35-56
Author(s):  
M. Habib Zahmani ◽  
B. Atmani

Identifying the best Dispatching Rule in order to minimize makespan in a Job Shop Scheduling Problem is a complex task, since no Dispatching Rule is better than all others in different scenarios, making the selection of a most effective rule which is time-consuming and costly. In this paper, a novel approach combining Data Mining, Simulation, and Dispatching Rules is proposed. The aim is to assign in real-time a set of Dispatching Rules to the machines on the shop floor while minimizing makespan. Experiments show that the suggested approach is effective and reduces the makespan within a range of 1–44%. Furthermore, this approach also reduces the required computation time by using Data Mining to determine and assign the best Dispatching Rules to machines.


Processes ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 1398
Author(s):  
Jae-Gon Kim ◽  
Hong-Bae Jun ◽  
June-Young Bang ◽  
Jong-Ho Shin ◽  
Seong-Hoon Choi

In many manufacturing or service industries, there exists maximum allowable tardiness for orders, according to purchase contracts between the customers and suppliers. Customers may cancel their orders and request compensation for damages, for breach of contract, when the delivery time is expected to exceed maximum allowable tardiness, whereas they may accept the delayed delivery of orders with a reasonable discount of price within maximum allowable tardiness. Although many research works have been produced on the job shop scheduling problem relating to minimizing total tardiness, none of them have yet considered problems with maximum allowable tardiness. In this study, we solve a job shop scheduling problem under maximum allowable tardiness, with the objective of minimizing tardiness penalty costs. Two kinds of penalty costs are considered, i.e., one for tardy jobs, and the other for canceled jobs. To deal with this problem within a reasonable time at actual production facilities, we propose several dispatching rules by extending well-known dispatching rules for the job shop scheduling problem, in cooperation with a probabilistic conception of those rules. To evaluate the proposed rules, computational experiments were carried out on 300 test instances. The test results show that the suggested probabilistic dispatching rules work better than the existing rules and the optimization solver CPLEX, with a time limit.


2021 ◽  
Author(s):  
Pramit Shah

Dispatching rules are a popular and commonly researched technique for scheduling tasks in job shops. Much of the past research has looked at the performance of various dispatching rules when a single rule is applied in common to all machines. However, better schedules can frequently be obtained if the machines are allowed to use different rules from one another. This research investigates an intelligent system that selects dispatching rules to use on each machine in the shop, based on a statistical description of the routings, processing times and mix of the jobs to be processed. Randomly generated problems are scheduled using permutations of three different dispatching rules on five machines. A neural network is then trained by using a commercial package to associate the statistical description of each problem with its best solution. Once trained, a network is able to recommend for new problems a dispatching rule to use on each machine. Two networks were trained separately for minimizing makespan and the total flowtime in the job shop. Test results showed that the combination of dispatching rules suggested by the trained networks produced better results for both objectives than the alternative of using the one identical rule on all machines.


2014 ◽  
Vol 556-562 ◽  
pp. 4412-4416
Author(s):  
Fu Qing Zhao ◽  
Ning Li

In this paper, a comparative study on the performance of scheduling rules in job shop. Four new dispatching rules are proposed. mean, maximum ,variance of tardiness and proportion of tardy jobs have been used to evaluate the performance of various scheduling rules. Breakdown level, shop load level was considered in the comparative study. The simulation result indicate the performance of dispatching rules is being influenced by Breakdown level, shop load level.


2020 ◽  
Author(s):  
S Nguyen ◽  
Mengjie Zhang ◽  
M Johnston ◽  
KC Tan

© 2019, Springer International Publishing AG, part of Springer Nature. Designing effective scheduling rules or heuristics for a manufacturing system such as job shops is not a trivial task. In the early stage, scheduling experts rely on their experiences to develop dispatching rules and further improve them through trials-and-errors, sometimes with the help of computer simulations. In recent years, automated design approaches have been applied to develop effective dispatching rules for job shop scheduling (JSS). Genetic programming (GP) is currently the most popular approach for this task. The goal of this chapter is to summarise existing studies in this field to provide an overall picture to interested researchers. Then, we demonstrate some recent ideas to enhance the effectiveness of GP for JSS and discuss interesting research topics for future studies.


2021 ◽  
Author(s):  
Atiya Masood ◽  
Yi Mei ◽  
Gang Chen ◽  
Mengjie Zhang

In Job Shop Scheduling (JSS) problems, there are usually many conflicting objectives to consider, such as the makespan, mean flowtime, maximal tardiness, number of tardy jobs, etc. Most studies considered these objectives separately or aggregated them into a single objective (fitness function) and treat the problem as a single-objective optimization. Very few studies attempted to solve the multi-objective JSS with two or three objectives, not to mention the many-objective JSS with more than three objectives. In this paper, we investigate the many-objective JSS, which takes all the objectives into account. On the other hand, dispatching rules have been widely used in JSS due to its flexibility, scalability and quick response in dynamic environment. In this paper, we focus on evolving a set of trade-off dispatching rules for many-objective JSS, which can generate non-dominated schedules given any unseen instance. To this end, a new hybridized algorithm that combines Genetic Programming (GP) and NSGA-III is proposed. The experimental results demonstrates the efficacy of the newly proposed algorithm on the tested job-shop benchmark instances. © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.


2021 ◽  
Author(s):  
Atiya Masood ◽  
Yi Mei ◽  
Gang Chen ◽  
Mengjie Zhang

In Job Shop Scheduling (JSS) problems, there are usually many conflicting objectives to consider, such as the makespan, mean flowtime, maximal tardiness, number of tardy jobs, etc. Most studies considered these objectives separately or aggregated them into a single objective (fitness function) and treat the problem as a single-objective optimization. Very few studies attempted to solve the multi-objective JSS with two or three objectives, not to mention the many-objective JSS with more than three objectives. In this paper, we investigate the many-objective JSS, which takes all the objectives into account. On the other hand, dispatching rules have been widely used in JSS due to its flexibility, scalability and quick response in dynamic environment. In this paper, we focus on evolving a set of trade-off dispatching rules for many-objective JSS, which can generate non-dominated schedules given any unseen instance. To this end, a new hybridized algorithm that combines Genetic Programming (GP) and NSGA-III is proposed. The experimental results demonstrates the efficacy of the newly proposed algorithm on the tested job-shop benchmark instances. © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.


2020 ◽  
Author(s):  
S Nguyen ◽  
Mengjie Zhang ◽  
M Johnston ◽  
KC Tan

© 2019, Springer International Publishing AG, part of Springer Nature. Designing effective scheduling rules or heuristics for a manufacturing system such as job shops is not a trivial task. In the early stage, scheduling experts rely on their experiences to develop dispatching rules and further improve them through trials-and-errors, sometimes with the help of computer simulations. In recent years, automated design approaches have been applied to develop effective dispatching rules for job shop scheduling (JSS). Genetic programming (GP) is currently the most popular approach for this task. The goal of this chapter is to summarise existing studies in this field to provide an overall picture to interested researchers. Then, we demonstrate some recent ideas to enhance the effectiveness of GP for JSS and discuss interesting research topics for future studies.


Sign in / Sign up

Export Citation Format

Share Document