Minimization of Makespan and Total Completion Time for Hybrid Job Shop Scheduling Problem Using Genetic Approaches.
Seifeddine AbdelhakIssam NouaouriSaoussen KrichenGilles GoncalvesPublished in: Int. J. Artif. Intell. Tools (2023)
Keyphrases
- job shop scheduling problem
- scheduling problem
- genetic algorithm
- tabu search
- job shop scheduling
- objective function
- benchmark problems
- critical path
- lower bound
- single machine
- production scheduling
- processing times
- memetic algorithm
- benchmark instances
- total weighted tardiness
- information retrieval
- graph model
- flowshop
- vehicle routing problem
- metaheuristic