Due Date Assignment in a Multistage Job Shop

1989 ◽  
Vol 21 (2) ◽  
pp. 153-161 ◽  
Author(s):  
TIMOTHY D. FRY ◽  
PATRICK R. PHILIPOOM ◽  
ROBERT E. MARKLAND
Keyword(s):  
Job Shop ◽  
Due Date ◽  
Due Date Assignment

Genetic Programming for Evolving Due-Date Assignment Models in Job Shop Environments

2014 ◽  
Vol 22 (1) ◽  
pp. 105-138 ◽  
Author(s):  
Su Nguyen ◽  
Mengjie Zhang ◽  
Mark Johnston ◽  
Kay Chen Tan
Keyword(s):  
Genetic Programming ◽  
Job Shop ◽  
Experimental Results ◽  
Job Shops ◽  
Due Date ◽  
Dynamic Nature ◽  
Due Date Assignment ◽  
Delivery Performance ◽  
Aggregate Information ◽  
Assignment Models

Due-date assignment plays an important role in scheduling systems and strongly influences the delivery performance of job shops. Because of the stochastic and dynamic nature of job shops, the development of general due-date assignment models (DDAMs) is complicated. In this study, two genetic programming (GP) methods are proposed to evolve DDAMs for job shop environments. The experimental results show that the evolved DDAMs can make more accurate estimates than other existing dynamic DDAMs with promising reusability. In addition, the evolved operation-based DDAMs show better performance than the evolved DDAMs employing aggregate information of jobs and machines.

Sign in / Sign up

Export Citation Format

Share Document