scholarly journals Designing Dispatching Rules to Minimize Total Tardiness

Author(s):  
Joc Cing Tay ◽  
Nhu Binh Ho
2012 ◽  
Vol 152-154 ◽  
pp. 1487-1491
Author(s):  
Parinya Kaweegitbundit

This paper considers two stage hybrid flow shop with identical parallel machine and evaluate performance of common dispatching rules; shortage processing time (SPT) longest processing time (LPT) earliness due date (EDD) and first in first out (FIFO). The objectives are to determine makespan and total tardiness have been minimized. To evaluated performance of dispatching rules, the results have been compared on each criterion. The experimental results show that SPT outperform than other rules with minimizes makespan as an objective function for all problems. On the other hand, for minimize total tardiness as an objective. The EDD rule outperform than other rules.


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.


Author(s):  
Marco Amorim ◽  
Sara Ferreira ◽  
António Couto

In an era of information and advanced computing power, emergency medical services (EMS) still rely on rudimentary vehicle dispatching and reallocation rules. In many countries, road conditions such as traffic or road blocks, exact vehicle positions, and demand prediction are valuable information that is not considered when locating and dispatching emergency vehicles. Within this context, this paper presents an investigation of different EMS vehicle dispatching rules by comparing them using various metrics and frameworks. An intelligent dispatching algorithm is proposed, and survival metrics are introduced to compare the new concepts with the classic ones. This work shows that the closest idle vehicle rule (classic dispatching rule) is far from optimal and even a random dispatching of vehicles can outperform it. The proposed intelligent algorithm has the best performance in all the tested situations where resources are adequate. If resources are scarce, especially during peaks in demand, dispatching delays will occur, degrading the system’s performance. In this case, no conclusion could be drawn as to which rule might be the best option. Nevertheless, it draws attention to the need for research focused on managing dispatch delays by prioritizing the waiting calls that inflict the higher penalty on the system performance. Finally, the authors conclude that the use of real traffic information introduces a considerable gain to the EMS response performance.


2017 ◽  
Vol 78 (4) ◽  
pp. 732-740 ◽  
Author(s):  
A. A. Lazarev ◽  
P. S. Korenev ◽  
A. A. Sologub
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document