Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility

2015 ◽  
Vol 14 (4) ◽  
Author(s):  
Karn Moonsri ◽  
Kanchana Sethanan ◽  
Chatnugrob Sangsawang
Keyword(s):  
Parallel Machines ◽  
Setup Time ◽  
Unrelated Parallel Machines ◽  
Sequence Dependent ◽  
Machine Eligibility ◽  
Sequence Dependent Setup Time ◽  
Sequence Dependent Setup

scholarly journals Mathematical Modeling and Discrete Firefly Algorithm to Optimize Scheduling Problem with Release Date, Sequence-Dependent Setup Time, and Periodic Maintenance

2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Mustafa A. Qamhan ◽  
Ammar A. Qamhan ◽  
Ibrahim M. Al-Harkan ◽  
Yousef A. Alotaibi
Keyword(s):  
Firefly Algorithm ◽  
Programming Model ◽  
Setup Time ◽  
Mixed Integer ◽  
Release Date ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Periodic Maintenance ◽  
Discrete Firefly Algorithm ◽  
Sequence Dependent Setup

An evolutionary discrete firefly algorithm (EDFA) is presented herein to solve a real-world manufacturing system problem of scheduling a set of jobs on a single machine subject to nonzero release date, sequence-dependent setup time, and periodic maintenance with the objective of minimizing the maximum completion time “makespan.” To evaluate the performance of the proposed EDFA, a new mixed-integer linear programming model is also proposed for small-sized instances. Furthermore, the parameters of the EDFA are regulated using full factorial analysis. Finally, numerical experiments are performed to demonstrate the efficiency and capability of the EDFA in solving the abovementioned problem.

Sign in / Sign up

Export Citation Format

Share Document