HIGHLIGHTS
- who: ÖZGÜR ÜNSAL from the Graduate School of Sciences and Engineering, Koç University, Istanbul, Turkey have published the Article: Reclaimer Scheduling in Dry Bulk Terminals, in the Journal: (JOURNAL)
- what: The authors develop a novel constraint programming formulation to provide an upper bound for the problem. Note that the formulation the authors develop strictly outperforms their MIP formulation which embeds eligibility restrictions into processing time parameter (see Section III-B1). In this formulation, for each machine, the authors determine a route over nodes where a node represents a task-time tuple (i, t), VOLUME . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.