default search action
"A computationally efficient Branch-and-Bound algorithm for the permutation ..."
Jan Gmys et al. (2020)
- Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem. Eur. J. Oper. Res. 284(3): 814-833 (2020)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.