Search Results for author:
Found 1 papers, 0 papers with code
Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem
The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem, with the additional constraint that jobs have to be processed by the successive machines without waiting time.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
