default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQuang-Vinh Dang 0002
Person information
- affiliation: Masaryk University, Brno, Czech Republic
- affiliation (former): Vietnamese-German University, Department of Global Production Engineering and Management, Binh Duong New City, Vietnam
- affiliation (former): Aalborg University, Department of Mechanical and Manufacturing Engineering, Denmark
Other persons with the same name
- Quang-Vinh Dang 0001
![[0000-0002-3877-8024]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-3877-8024")
(aka: Quang Vinh Dang 0001) — Industrial University of Ho Chi Minh City, Vietnam (and 1 more) - Quang-Vinh Dang 0003 — Eastern International University, Binh Duong, Vietnam
- Quang-Vinh Dang 0004 — Chonnam National University, Gwangju, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Nitish Singh, Alp Akcay, Quang-Vinh Dang, Tugce G. Martagan, Ivo Adan:
Dispatching AGVs with battery constraints using deep reinforcement learning. Comput. Ind. Eng. 187: 109678 (2024)- [j10]Jeroen B. H. C. Didden, Quang-Vinh Dang, Ivo J. B. F. Adan:
Enhancing stability and robustness in online machine shop scheduling: A multi-agent system and negotiation-based approach for handling machine downtime in industry 4.0. Eur. J. Oper. Res. 316(2): 569-583 (2024) - 2023
- [j9]Quang-Vinh Dang, Koen Herps, Tugce G. Martagan, Ivo Adan, Jasper Heinrich:
Unsupervised parallel machines scheduling with tool switches. Comput. Oper. Res. 160: 106361 (2023) - 2022
- [j8]Nitish Singh, Quang-Vinh Dang, Alp Akcay, Ivo Adan, Tugce G. Martagan:
A matheuristic for AGV scheduling with battery constraints. Eur. J. Oper. Res. 298(3): 855-873 (2022) - [c14]Quang-Vinh Dang, Tugce G. Martagan, Ivo Adan, Jan Kleinlugtenbeld:
Order Release Strategies for a Collaborative Order Picking System. WSC 2022: 1521-1532 - [c13]Jeroen B. H. C. Didden, Quang-Vinh Dang, Ivo J. B. F. Adan:
Workload Control in High-Mix-Low-Volume Factories Through the Use of a Multi-Agent System. WSC 2022: 1806-1817 - 2021
- [j7]Quang-Vinh Dang, Nitish Singh, Ivo Adan, Tugce G. Martagan, Dirk van de Sande:
Scheduling heterogeneous multi-load AGVs with battery constraints. Comput. Oper. Res. 136: 105517 (2021) - [j6]Quang-Vinh Dang, Thijs van Diessen, Tugce G. Martagan, Ivo Adan:
A matheuristic for parallel machine scheduling with tool replacements. Eur. J. Oper. Res. 291(2): 640-660 (2021)
2010 – 2019
- 2019
- [j5]Quang-Vinh Dang, Cong Thanh Nguyen, Hana Rudová:
Scheduling of mobile robots for transportation and manufacturing tasks. J. Heuristics 25(2): 175-213 (2019) - [c12]Quang-Vinh Dang, Hana Rudová, Cong Thanh Nguyen:
Adaptive large neighborhood search for scheduling of mobile robots. GECCO 2019: 224-232 - 2018
- [c11]Quang-Vinh Dang, Hana Rudová:
Enhanced Scheduling for Real-Time Traffic Control. SSCI 2018: 578-585 - 2017
- [j4]Quang-Vinh Dang, Lam Nguyen:
Makespan minimisation for pre-emptive scheduling of mobile robots in FMS environment. Int. J. Metaheuristics 6(1/2): 3-36 (2017) - [j3]Izabela Nielsen, Quang-Vinh Dang, Grzegorz Bocewicz, Zbigniew Antoni Banaszak:
A methodology for implementation of mobile robot in adaptive manufacturing environments. J. Intell. Manuf. 28(5): 1171-1188 (2017) - 2016
- [c10]Lam Nguyen, Quang-Vinh Dang, Izabela Nielsen:
GA-Based Scheduling for Transporting and Manufacturing Mobile Robots in FMS. DCAI 2016: 555-563 - 2014
- [j2]Quang-Vinh Dang, Izabela Nielsen, Kenn Steger-Jensen, Ole Madsen:
Scheduling a single mobile robot for part-feeding tasks of production lines. J. Intell. Manuf. 25(6): 1271-1287 (2014) - [c9]Izabela Nielsen, Quang-Vinh Dang, Peter Nielsen, Pawel Pawlewski:
Scheduling of Mobile Robots with Preemptive Tasks. DCAI 2014: 19-27 - 2013
- [c8]Quang-Vinh Dang, Izabela Nielsen, Simon Bøgh, Grzegorz Bocewicz:
Modelling and Scheduling Autonomous Mobile Robot for a Real-World Industrial Application. MIM 2013: 2098-2103 - [c7]Grzegorz Bocewicz, Peter Nielsen, Zbigniew Antoni Banaszak, Quang-Vinh Dang:
Multimodal Processes Cyclic Steady States Scheduling. PAAMS (Workshops) 2013: 73-85 - [c6]Quang-Vinh Dang, Izabela Nielsen:
Simultaneous Scheduling of Machines and Mobile Robots. PAAMS (Workshops) 2013: 118-128 - 2012
- [j1]Quang-Vinh Dang, Won Young Yun, Herbert Kopfer:
Positioning empty containers under dependent demand process. Comput. Ind. Eng. 62(3): 708-715 (2012) - [c5]Quang-Vinh Dang, Izabela Nielsen, Kenn Steger-Jensen:
Multi-objective Genetic Algorithm for Real-World Mobile Robot Scheduling Problem. APMS (1) 2012: 518-525 - [c4]Grzegorz Bocewicz, Zbigniew Antoni Banaszak, Peter Nielsen, Quang-Vinh Dang:
Multimodal Processes Rescheduling. APMS (1) 2012: 534-541 - [c3]Quang-Vinh Dang, Izabela Ewa Nielsen, Grzegorz Bocewicz:
A Genetic Algorithm-Based Heuristic for Part-Feeding Mobile Robot Scheduling Problem. PAAMS (Workshops) 2012: 85-92 - 2011
- [c2]Grzegorz Bocewicz, Peter Nielsen, Zbigniew Antoni Banaszak, Quang-Vinh Dang:
Cyclic Steady State Refinement: Multimodal Processes Perspective. APMS 2011: 18-26 - [c1]Quang-Vinh Dang, Izabela Nielsen, Kenn Steger-Jensen:
Mathematical Formulation for Mobile Robot Scheduling Problem in a Manufacturing Cell. APMS 2011: 37-44
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
