Directing the Search of Evolutionary and Neighbourhood-Search Optimisers for the Flowshop Sequencing Problem with an Idle-Time Heuristic.
Peter RossAndrew TusonPublished in: Evolutionary Computing, AISB Workshop (1997)
Keyphrases
- neighbourhood search
- scheduling problem
- flowshop
- search algorithm
- single machine
- tabu search
- maximum tardiness
- minimizing makespan
- number of tardy jobs
- search procedure
- flowshop scheduling
- search space
- processing times
- bicriteria
- genetic algorithm
- release dates
- np hard
- preventive maintenance
- strongly np hard
- total tardiness
- setup times
- flowshop scheduling problems
- sequence dependent setup times
- efficient solutions
- lagrangian relaxation
- job shop scheduling problem