Using Genetic Algorithms to solve scheduling problems on flexible manufacturing systems (FMS): a literature survey, classification and analysis
M Godinho Filho, CF Barco… - Flexible Services and …, 2014 - Springer
This paper reviews the literature regarding Genetic Algorithms (GAs) applied to flexible
manufacturing system (FMS) scheduling. On the basis of this literature review, a …
manufacturing system (FMS) scheduling. On the basis of this literature review, a …
An effective new island model genetic algorithm for job shop scheduling problem
M Kurdi - Computers & operations research, 2016 - Elsevier
This paper presents an effective new island model genetic algorithm to solve the well-known
job shop scheduling problem with the objective of minimizing the makespan. To improve the …
job shop scheduling problem with the objective of minimizing the makespan. To improve the …
An efficient genetic algorithm for job shop scheduling with tardiness objectives
DC Mattfeld, C Bierwirth - European journal of operational research, 2004 - Elsevier
We consider job shop scheduling problems with release and due-dates, as well as various
tardiness objectives. To date, no efficient general-purpose heuristics have been developed …
tardiness objectives. To date, no efficient general-purpose heuristics have been developed …
Genetic algorithm applications on job shop scheduling problem: A review
N Bhatt, NR Chauhan - 2015 International Conference on Soft …, 2015 - ieeexplore.ieee.org
Job shop scheduling is an assignment of a number of jobs which are to be processed under
a number of machines for certain amount of time. The arrival pattern of the jobs is either …
a number of machines for certain amount of time. The arrival pattern of the jobs is either …
Order acceptance using genetic algorithms
WO Rom, SA Slotnick - Computers & Operations Research, 2009 - Elsevier
This paper uses a genetic algorithm to solve the order-acceptance problem with tardiness
penalties. We compare the performance of a myopic heuristic and a genetic algorithm, both …
penalties. We compare the performance of a myopic heuristic and a genetic algorithm, both …
Memetic algorithms for solving job-shop scheduling problems
The job-shop scheduling problem is well known for its complexity as an NP-hard problem.
We have considered JSSPs with an objective of minimizing makespan while satisfying a …
We have considered JSSPs with an objective of minimizing makespan while satisfying a …
Multi-operator communication based differential evolution with sequential Tabu Search approach for job shop scheduling problems
This paper develops a multi-operator based differential evolution with a communication
strategy (MCDE) being integrated with a sequential Tabu Search (MCDE/TS) to solve the job …
strategy (MCDE) being integrated with a sequential Tabu Search (MCDE/TS) to solve the job …
A new hybrid island model genetic algorithm for job shop scheduling problem
M Kurdi - Computers & Industrial Engineering, 2015 - Elsevier
This paper presents a new hybrid island model genetic algorithm (HIMGA) to solve the well-
known job shop scheduling problem (JSSP) with the objective of makespan minimization. To …
known job shop scheduling problem (JSSP) with the objective of makespan minimization. To …
Anticipation and flexibility in dynamic scheduling
J Branke*, DC Mattfeld - International Journal of Production …, 2005 - Taylor & Francis
Many real-world optimization problems change over time and require frequent re-
optimization. We suggest that in such environments, an optimization algorithm should reflect …
optimization. We suggest that in such environments, an optimization algorithm should reflect …
Switching strategy-based hybrid evolutionary algorithms for job shop scheduling problems
Since production efficiency and costs are directly affected by the ways in which jobs are
scheduled, scholars have advanced a number of meta-heuristic algorithms to solve the job …
scheduled, scholars have advanced a number of meta-heuristic algorithms to solve the job …