List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
Heuristic methods for the flexible job shop with sequencing flexibility are introduced. The problem has important practical applications in, e.g. the printing industry. Introduced methods are fully described and their implementations publicly available. Complete description of the results makes possible its usage for benchmarking.
list scheduling scheduling beam search flexible job shop makespan