A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
Work
Year: 2019
Type: article
Source: Computers & Operations Research
Institution Universidad de Sevilla
Cites: 19
Cited by: 36
Related to: 10
FWCI: 5.749
Citation percentile (by year/subfield): 93.18
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: closed