Simulated annealing: theory and applications
Simulated annealing: theory and applications
Two machine open shop scheduling problem with setup, processing and removal times separated
Computers and Operations Research
A genetic algorithm for the job shop problem
Computers and Operations Research - Special issue on genetic algorithms
A branch & bound algorithm for the open-shop problem
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
A tabu search algorithm for the open shop scheduling problem
Computers and Operations Research
Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
An effective hybrid optimization strategy for job-shop scheduling problems
Computers and Operations Research
Tabu Search
Genetic Algorithms
The hybrid heuristic genetic algorithm for job shop scheduling
Computers and Industrial Engineering
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem
Computers and Operations Research
An ant colony system for permutation flow-shop sequencing
Computers and Operations Research
A hybrid genetic algorithm for the job shop scheduling problems
Computers and Industrial Engineering
Hybrid genetic algorithm for optimization problems with permutation property
Computers and Operations Research
Computers and Industrial Engineering
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
Computers and Operations Research
A hybrid genetic algorithm for the flow-shop scheduling problem
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Evolutionary computation for minimizing makespan on identical machines with mold constraints
WSEAS Transactions on Systems and Control
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
This report proposes a solution to the open shop scheduling problem with the objective of minimizing total job tardiness in the system. Some practical processing restrictions, such as independent setup and dependent removal times, are taken into account as well. The addressed problem is first described as a 0-1 integer programming model, and is then solved optimally. Subsequently, some hybrid genetic-based heuristics are proposed to solve the problem in an acceptable computation time. To demonstrate the adaptability of these heuristics, some performance comparisons are made with solutions provided by running either a mathematical programming model or certain classic meta-heuristics such as genetic algorithm, simulated annealing, and tabu search in various manufacturing scenarios. The experimental results show that the hybrid genetic-based heuristics perform well, especially the DGA. However, these heuristics require some more additional computations but are still acceptable.