Matches in SemOpenAlex for { <https://semopenalex.org/work/W4384161751> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W4384161751 abstract "Scheduling frameworks are not necessarily stable. The aim is to introduce schedules resistant to disruptions such as when resources become unavailable, the supply chain for them breaks down, etc. A schedule is robust if it absorbs some level of unforeseen events when at most a certain number of activities are delayed. Taking advantage of constraint programming, we present two new filtering algorithms for a constraint that models cumulative scheduling problems in robust contexts where up to [Formula: see text] out of [Formula: see text] tasks can be concurrently delayed while keeping the schedule valid. We adapt the overload-checking and edge-finding filtering rules for this framework. We show that our robust versions of these algorithms run in [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] denotes the number of distinct capacities of all tasks. This achievement implies that the complexities of the state-of-the-art algorithms for these techniques are invariable when [Formula: see text] is constant. Experiments illustrate that our algorithms scale, with respect to [Formula: see text] and [Formula: see text]. As a practical application, the experimental results on a special case of crane assignment problem also verify a stronger filtering for these methods in terms of backtrack numbers as well as computation times when used in conjunction with time tabling. Finally, in order to show that our CP-based algorithms improve to solve a robust scheduling problem, we make a comparison against temporal protection as an external robust scheduling approach. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms – Discrete. Funding: H. Fahimi received funding from Shahid Chamran University of Ahvaz with [Grant number SCU.MC1402.44132]. C.-G. Quimper was funded by a NSERC Discovery Grant from Canada. Supplemental Material: The e-companion is available at https://doi.org/10.1287/ijoc.2021.0138 ." @default.
- W4384161751 created "2023-07-14" @default.
- W4384161751 creator A5046366918 @default.
- W4384161751 creator A5048887492 @default.
- W4384161751 date "2023-07-13" @default.
- W4384161751 modified "2023-09-25" @default.
- W4384161751 title "Overload-Checking and Edge-Finding for Robust Cumulative Scheduling" @default.
- W4384161751 cites W118482379 @default.
- W4384161751 cites W1530927535 @default.
- W4384161751 cites W1643654880 @default.
- W4384161751 cites W18767501 @default.
- W4384161751 cites W1990329786 @default.
- W4384161751 cites W2025389484 @default.
- W4384161751 cites W2044333886 @default.
- W4384161751 cites W2044572576 @default.
- W4384161751 cites W2086693061 @default.
- W4384161751 cites W2122960360 @default.
- W4384161751 cites W2801887155 @default.
- W4384161751 cites W2810650555 @default.
- W4384161751 cites W2898848914 @default.
- W4384161751 cites W2944472270 @default.
- W4384161751 cites W4234582748 @default.
- W4384161751 cites W80710014 @default.
- W4384161751 doi "https://doi.org/10.1287/ijoc.2021.0138" @default.
- W4384161751 hasPublicationYear "2023" @default.
- W4384161751 type Work @default.
- W4384161751 citedByCount "0" @default.
- W4384161751 crossrefType "journal-article" @default.
- W4384161751 hasAuthorship W4384161751A5046366918 @default.
- W4384161751 hasAuthorship W4384161751A5048887492 @default.
- W4384161751 hasConcept C111919701 @default.
- W4384161751 hasConcept C11413529 @default.
- W4384161751 hasConcept C126255220 @default.
- W4384161751 hasConcept C206729178 @default.
- W4384161751 hasConcept C33923547 @default.
- W4384161751 hasConcept C41008148 @default.
- W4384161751 hasConcept C45374587 @default.
- W4384161751 hasConcept C68387754 @default.
- W4384161751 hasConceptScore W4384161751C111919701 @default.
- W4384161751 hasConceptScore W4384161751C11413529 @default.
- W4384161751 hasConceptScore W4384161751C126255220 @default.
- W4384161751 hasConceptScore W4384161751C206729178 @default.
- W4384161751 hasConceptScore W4384161751C33923547 @default.
- W4384161751 hasConceptScore W4384161751C41008148 @default.
- W4384161751 hasConceptScore W4384161751C45374587 @default.
- W4384161751 hasConceptScore W4384161751C68387754 @default.
- W4384161751 hasLocation W43841617511 @default.
- W4384161751 hasOpenAccess W4384161751 @default.
- W4384161751 hasPrimaryLocation W43841617511 @default.
- W4384161751 hasRelatedWork W1572523360 @default.
- W4384161751 hasRelatedWork W1992741870 @default.
- W4384161751 hasRelatedWork W2368370270 @default.
- W4384161751 hasRelatedWork W2385999557 @default.
- W4384161751 hasRelatedWork W2386767533 @default.
- W4384161751 hasRelatedWork W2386859939 @default.
- W4384161751 hasRelatedWork W2546696010 @default.
- W4384161751 hasRelatedWork W2997221951 @default.
- W4384161751 hasRelatedWork W3068261568 @default.
- W4384161751 hasRelatedWork W3174582865 @default.
- W4384161751 isParatext "false" @default.
- W4384161751 isRetracted "false" @default.
- W4384161751 workType "article" @default.