Matches in SemOpenAlex for { <https://semopenalex.org/work/W1532853582> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W1532853582 endingPage "465" @default.
- W1532853582 startingPage "465" @default.
- W1532853582 abstract "Extended Abstract. In this paper we develop and analyse CSP-based procedures for solving scheduling problems with metric temporal constraints (e.g. jobs’ deadlines or separation constraints between couple of consecutive activities in a job) and multiple capacitated resources, referred to formally as the Multiple Capacitated Metric Scheduling Problem (MCM-SP). This work follows two different solution approaches used to identify resource capacity conflicts. (1) Proffle-based approaches (e.g. [1]) - They consist of characterizing a resource demand as a function of time, identifying periods of overallocation in this demand proffle, and incrementally performing “eveling actions” to (hopefully) ensure that resource usage peaks fall below the total capacity of the resource. (2) Clique-based approaches [3, 2] - Given a current schedule, this approach builds up a conflicts graph whose nodes are activities and whose edges represent overlapping resource capacity requests of the connected activities. Fully connected subgraphs (cliques) are identiffed and if the number of nodes in the clique is greater than resource capacity a conflict is detectedClique-based approaches perform more global analysis and offer greater accuracy in conflict detection in comparison with local pairwise proffle-based analysis, but at a potentially much higher computational cost. In a previous paper [1], several proffle-based solution procedures were developed and evaluated (in particular the ESTA algorithm), some of them descending from an approach proposed in the planning literature. KeywordsSchedule ProblemTemporal ConstraintHigh Computational CostResource DemandResource CapacityThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves." @default.
- W1532853582 created "2016-06-24" @default.
- W1532853582 creator A5043058554 @default.
- W1532853582 creator A5052621202 @default.
- W1532853582 creator A5053720611 @default.
- W1532853582 date "1998-01-01" @default.
- W1532853582 modified "2023-09-27" @default.
- W1532853582 title "Scheduling Multi-Capacitated Resources under Complex Temporal Constraints" @default.
- W1532853582 cites W108408365 @default.
- W1532853582 cites W1508605493 @default.
- W1532853582 doi "https://doi.org/10.1007/3-540-49481-2_36" @default.
- W1532853582 hasPublicationYear "1998" @default.
- W1532853582 type Work @default.
- W1532853582 sameAs 1532853582 @default.
- W1532853582 citedByCount "9" @default.
- W1532853582 countsByYear W15328535822012 @default.
- W1532853582 countsByYear W15328535822013 @default.
- W1532853582 countsByYear W15328535822014 @default.
- W1532853582 crossrefType "book-chapter" @default.
- W1532853582 hasAuthorship W1532853582A5043058554 @default.
- W1532853582 hasAuthorship W1532853582A5052621202 @default.
- W1532853582 hasAuthorship W1532853582A5053720611 @default.
- W1532853582 hasConcept C111919701 @default.
- W1532853582 hasConcept C114614502 @default.
- W1532853582 hasConcept C126255220 @default.
- W1532853582 hasConcept C154945302 @default.
- W1532853582 hasConcept C184898388 @default.
- W1532853582 hasConcept C206729178 @default.
- W1532853582 hasConcept C2777035058 @default.
- W1532853582 hasConcept C33923547 @default.
- W1532853582 hasConcept C41008148 @default.
- W1532853582 hasConcept C42475967 @default.
- W1532853582 hasConcept C55416958 @default.
- W1532853582 hasConcept C68387754 @default.
- W1532853582 hasConceptScore W1532853582C111919701 @default.
- W1532853582 hasConceptScore W1532853582C114614502 @default.
- W1532853582 hasConceptScore W1532853582C126255220 @default.
- W1532853582 hasConceptScore W1532853582C154945302 @default.
- W1532853582 hasConceptScore W1532853582C184898388 @default.
- W1532853582 hasConceptScore W1532853582C206729178 @default.
- W1532853582 hasConceptScore W1532853582C2777035058 @default.
- W1532853582 hasConceptScore W1532853582C33923547 @default.
- W1532853582 hasConceptScore W1532853582C41008148 @default.
- W1532853582 hasConceptScore W1532853582C42475967 @default.
- W1532853582 hasConceptScore W1532853582C55416958 @default.
- W1532853582 hasConceptScore W1532853582C68387754 @default.
- W1532853582 hasLocation W15328535821 @default.
- W1532853582 hasOpenAccess W1532853582 @default.
- W1532853582 hasPrimaryLocation W15328535821 @default.
- W1532853582 hasRelatedWork W1005951749 @default.
- W1532853582 hasRelatedWork W173994594 @default.
- W1532853582 hasRelatedWork W189508809 @default.
- W1532853582 hasRelatedWork W2104653816 @default.
- W1532853582 hasRelatedWork W2296083055 @default.
- W1532853582 hasRelatedWork W2396492580 @default.
- W1532853582 hasRelatedWork W2588949834 @default.
- W1532853582 hasRelatedWork W2618870441 @default.
- W1532853582 hasRelatedWork W2782432796 @default.
- W1532853582 hasRelatedWork W2799339823 @default.
- W1532853582 hasRelatedWork W2903396372 @default.
- W1532853582 hasRelatedWork W2905402182 @default.
- W1532853582 hasRelatedWork W3035701046 @default.
- W1532853582 hasRelatedWork W3037741482 @default.
- W1532853582 hasRelatedWork W3092357165 @default.
- W1532853582 hasRelatedWork W3119146440 @default.
- W1532853582 hasRelatedWork W3122145276 @default.
- W1532853582 hasRelatedWork W3159561424 @default.
- W1532853582 hasRelatedWork W3170807718 @default.
- W1532853582 hasRelatedWork W3186047907 @default.
- W1532853582 isParatext "false" @default.
- W1532853582 isRetracted "false" @default.
- W1532853582 magId "1532853582" @default.
- W1532853582 workType "book-chapter" @default.