Optimally Solving the Generalized Serial-lock Scheduling Problem from a Graph-theory-based Multi-commodity Network Perspective

Ji, Bin, Zhang, Dezhi, Yu, Shenglong and Zhang, Binqiao 2020, Optimally Solving the Generalized Serial-lock Scheduling Problem from a Graph-theory-based Multi-commodity Network Perspective, European Journal of Operational Research, pp. 1-27, doi: 10.1016/j.ejor.2020.05.035.

Attached Files
Name Description MIMEType Size Downloads

Title Optimally Solving the Generalized Serial-lock Scheduling Problem from a Graph-theory-based Multi-commodity Network Perspective
Author(s) Ji, Bin
Zhang, Dezhi
Yu, ShenglongORCID iD for Yu, Shenglong orcid.org/0000-0002-2983-7344
Zhang, Binqiao
Journal name European Journal of Operational Research
Start page 1
End page 27
Total pages 27
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2020
ISSN 0377-2217
Keyword(s) Combinatorial optimization
inland waterway
serial-lock scheduling
multi-commodity network
mixed integer linear programming
Notes In Press
Language eng
DOI 10.1016/j.ejor.2020.05.035
Indigenous content off
Field of Research MD Multidisciplinary
HERDC Research category C1 Refereed article in a scholarly journal
Persistent URL http://hdl.handle.net/10536/DRO/DU:30137285

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 32 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Tue, 26 May 2020, 14:24:51 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.