Production scheduling in flexible job shop scheduling using an Imperialist Competitive Algorithm (ICA) minimizing makespan

2015 ◽  
Author(s):  
I. I. Brian Beltran Ricaurte ◽  
Maria Isabel Londono Restrepo
Keyword(s):  
Production Scheduling ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Imperialist Competitive Algorithm ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling ◽  
Competitive Algorithm

scholarly journals Partial flexible job shop scheduling considering preventive maintenance and priorities

2020 ◽  
Vol 11 (2) ◽  
pp. 27
Author(s):  
Ameneh Farahani ◽  
Hamid Tohidi ◽  
Mehran Khalaj ◽  
Ahmad Shoja
Keyword(s):  
Preventive Maintenance ◽  
Production Scheduling ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Programming Model ◽  
Model Parameters ◽  
Flexible Job Shop ◽  
Scheduling Problems ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling

<p>In this paper, a new mathematical programming model is proposed for a partial flexible job shop scheduling problem with an integrated solution approach. The purpose of this model is the assignment of production operations to machines with the goal of simultaneously minimizing operating costs and penalties. These penalties include delayed delivery, deviation from a fixed time point for preventive maintenance, and deviation from the priorities of each machine. Considering the priorities for machines in partial flexible job shop scheduling problems can be a contribution in closer to the reality of production systems. For validation and evaluation of the effectiveness of the model, several numerical examples are solved by using the Baron solver in GAMS. Sensitivity analysis is performed for the model parameters. The results further indicate the relationship between scheduling according to priorities of each machine and production scheduling.</p><p><em><br /></em></p><p><em><br /></em></p>

Sign in / Sign up

Export Citation Format

Share Document