A k-swap Local Search for Makespan Scheduling.
Lars RohwedderAshkan SafariTjark VredeveldPublished in: CoRR (2024)
Keyphrases
- scheduling problem
- tabu search
- job shop scheduling problem
- batch processing
- scheduling jobs
- release dates
- unrelated parallel machines
- flowshop
- single machine
- job shop
- deteriorating jobs
- batch processing machines
- processing times
- job shop scheduling
- parallel machines
- open shop
- maximum lateness
- optimal solution
- permutation flowshop
- precedence constraints
- memetic algorithm
- search algorithm
- search space
- scheduling algorithm
- combinatorial optimization
- graph cuts
- np hard
- global search
- genetic algorithm
- lower bound
- simulated annealing
- resource allocation
- minimizing makespan
- round robin
- single machine scheduling problem
- hybrid ga
- identical parallel machines
- information systems
- strongly np hard
- sequence dependent setup times
- neighborhood search
- production system
- setup times
- completion times
- search procedure
- identical machines
- initial solution
- objective function
- job processing times