A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach

2016 ◽  
Vol 36 (4) ◽  
pp. 1471-1515 ◽  
Author(s):  
Saeed Emami ◽  
Ghasem Moslehi ◽  
Mohammad Sabbagh
Keyword(s):  
Robust Optimization ◽  
Benders Decomposition ◽  
Optimization Approach ◽  
Scheduling Problem ◽  
Order Acceptance ◽  
Decomposition Approach ◽  
Order Acceptance And Scheduling

scholarly journals Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Cheng Chen ◽  
Zhenyu Yang ◽  
Yuejin Tan ◽  
Renjie He
Keyword(s):  
Genetic Algorithm ◽  
Production Systems ◽  
Hamming Distance ◽  
Scheduling Problem ◽  
Order Acceptance ◽  
Solution Quality ◽  
Survival Selection ◽  
Benchmark Instances ◽  
Order Acceptance And Scheduling ◽  
Dependent Setup Times

Selection and scheduling are an important topic in production systems. To tackle the order acceptance and scheduling problem on a single machine with release dates, tardiness penalty, and sequence-dependent setup times, in this paper a diversity controlling genetic algorithm (DCGA) is proposed, in which a diversified population is maintained during the whole search process through survival selection considering both the fitness and the diversity of individuals. To measure the similarity between individuals, a modified Hamming distance without considering the unaccepted orders in the chromosome is adopted. The proposed DCGA was validated on 1500 benchmark instances with up to 100 orders. Compared with the state-of-the-art algorithms, the experimental results show that DCGA improves the solution quality obtained significantly, in terms of the deviation from upper bound.

Sign in / Sign up

Export Citation Format

Share Document