A flexible dispatching rule for minimizing tardiness in job shop scheduling

Chen, Binchao; Matis, Timothy I.

doi:10.1016/j.ijpe.2012.08.019

Cited by 60 publications

(26 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Jayamohan and Rajendran (2004) propose costoriented priority rules for job shop scheduling in a setting where unequal penalties regarding the flowtime and tardiness of different jobs are considered. Chen and Matis (2013) propose a flexible priority rule for minimizing tardiness in an m-machine job shop.…”

Section: Related Workmentioning

confidence: 99%

Cluster analysis and neural network-based metamodeling of priority rules for dynamic sequencing

Xanthopoulos

Koulouriotis

2015

J Intell Manuf

View full text Add to dashboard Cite

Most sequencing problems deal with deterministic environments where all information is known in advance. However, in real-world problems multiple sources of uncertainty need to be taken into consideration. To model such a situation, in this article, a dynamic sequencing problem with random arrivals, processing times and due-dates is considered. The examined system is a manufacturing line with multiple job classes and sequence-dependent setups. The performance of the system is measured under the metrics of mean WIP, mean cycle time, mean earliness, mean tardiness, mean absolute lateness, and mean percentage of tardy jobs. Twelve job dispatching rules for solving this problem are considered and evaluated via simulation experiments. A statistically rigorous analysis of the solution approaches is carried out with the use of unsupervised and supervised learning methods. The cluster analysis of the experimental results identified classes of priority rules based on their observed performance. The characteristics of each priority rule class are documented and areas in objective space not covered by existing rules are identified. The functional relationship between sequencing priority rules and performance metrics of the production system was approximated by artificial neural networks. Apart from gaining insight into the mechanics of the sequencing approaches the results of this article can be used (1) as a component for prediction systems of dispatching rule output, (2) as a guideline for building new dispatching heuristic with entirely different characteris-B A. S. Xanthopoulos tics than existing ones, (3) to significantly decrease the length of what-if simulation studies.

show abstract

Section: Related Workmentioning

confidence: 99%

Cluster analysis and neural network-based metamodeling of priority rules for dynamic sequencing

Xanthopoulos

Koulouriotis

2015

J Intell Manuf

View full text Add to dashboard Cite

show abstract

“…The application of flexible scheduling to allocate resources contributes to an exponential increase in the search space. Thus, it is of great significance in reducing the search time of FJSP, and improving the accuracy and efficiency of the job-shop scheduling [1][2][3][4][5][6][7].…”

Section: Introductionmentioning

confidence: 99%

Research on the Multi-objective Optimized Scheduling of the Flexible Job-Shop Considering Multi-Resource Allocation

Zhong¹,

Li²,

Zhu³

2017

Int. j. simul. model.

View full text Add to dashboard Cite

Targeting at the problems existing in the multi-objective scheduling of traditional flexible job shop and the complexity of multi-resource allocation, this paper establishes an improved calculation model considering the optimization of such four targets as completion time, labour distribution, equipment compliance and production cost. The multi-objective integrated constraint optimization algorithm is designed and the Pareto solution set following different rules based on the NSGA-П algorithm is finally obtained. The research results show that the centralized selection of processing equipment and low efficiency of the job sequencing in the scheduling of traditional flexible job shop get improved. The personnel scheduling in the flexible working resources is highlighted, and multi-rule dynamic programming is introduced to get the optimal completion time and personnel allocation program. The optimal scheduling program can be quickly searched out using the NSGA-П algorithm, which effectively improves the search efficiency. The batch production within certain range can reduce the product processing time, but at the same time, it will increase the manufacturing costs. The use of smooth movement can reduce the overall processing time, but a too small movement volume will cause the increase in the number of movements. The exact match between the operators, numerical control equipment and the product processing procedures contributes to the feasibility of the preproduction operation plan.

show abstract

“…Lin et al [25] validated that the lot release decision significantly affects the cell process performance under different operating conditions, especially on the reduction of setup and cycle times. Order priority decision based on dispatching rules typically finds a good solution which are near the optimum, easy to implement, and faster to compute [2]. Moreover, common dispatching rules are excellent in certain cases, such as Critical Ratio (CR), which is excellent at ontime delivery performance [14].…”

Section: Introductionmentioning

confidence: 99%