Sökning: onr:"swepub:oai:DiVA.org:kth-290341" >
A Neighborhood Sele...
A Neighborhood Selection Strategy for Production Scheduling using CP and LNS
-
- Åstrand, Max (författare)
- KTH,Reglerteknik,Automation Solutions, ABB Corporate Research, Västerås, Sweden
-
- Johansson, Mikael (författare)
- KTH,Reglerteknik
-
(creator_code:org_t)
- Institute of Electrical and Electronics Engineers Inc. 2020
- 2020
- Engelska.
-
Ingår i: IEEE International Conference on Emerging Technologies and Factory Automation, ETFA. - : Institute of Electrical and Electronics Engineers Inc.. ; , s. 1183-1186
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- High-quality production scheduling is increasingly important in modern industry operations. We study a class of scheduling problems where jobs take place at predefined locations, as is common in mining, forestry and logistics. The proposed neighborhood selection algorithm is able to find high- quality solutions fast and guarantees that a globally optimal solution is eventually found. Preliminary results are promising.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Maskinteknik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Mechanical Engineering (hsv//eng)
Nyckelord
- constraint programming
- large neighborhood search
- production scheduling
- Factory automation
- Production control
- High quality
- High-quality solutions
- Industry operations
- Optimal solutions
- Scheduling problem
- Selection algorithm
- Scheduling
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)