Indian Journal of Science and Technology · 2011 · 10 citations · 19 references
ManagementIndustrial EngineeringOperations ManagementOperations PlanningOptimizationSchedulingCombinatorial OptimizationJob Shop SchedulingMachine SchedulingMakespan MinimizationMulti-objective SchedulingScheduling TheoryExpected Completion Time MinimizationExpected Time To CompletionFlexible Job Shop SchedulingMetaheuristic Scheduling
In this paper we present a clonal selection algorithm (CSA) to solve the Flexible Job-shop Scheduling Problem (FJSP). The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan. The performance of CSA is evaluated in comparison with Lingo 8 software. Experimental results prove that the CSA can be used to solve FJSP effectively. Keywords: Flexible Job-shop Scheduling Problem, Clonal selection algorithm, Makespan
19
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations