Matches in SemOpenAlex for { <https://semopenalex.org/work/W10028645> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W10028645 abstract "Spatial scheduling problems involve scheduling a set of activities or jobs that each require a certain amount of physical space in order to be carried out. In these problems space is a limited resource, and the job locations, orientations, and start times must be simultaneously determined. As a result, spatial scheduling problems are a particularly difficult class of scheduling problems. These problems are commonly encountered in diverse industries including shipbuilding, aircraft assembly, and supply chain management. Despite its importance, there is a relatively scarce amount of research in the area of spatial scheduling. In this dissertation, spatial scheduling problems are studied from a mathematical and algorithmic perspective. Optimization models based on integer programming are developed for several classes of spatial scheduling problems. While the majority of these models address problems having an objective of minimizing total tardiness, the models are shown to contain a core set of constraints that are common to most spatial scheduling problems. As a result, these constraints form the basis of the models given in this dissertation and many other spatial scheduling problems with different objectives as well. The complexity of these models is shown to be at least NP-complete, and spatial scheduling problems in general are shown to be NP-hard. A lower bound for the total tardiness objective is shown, and a polynomial-time algorithm for computing this lower bound is given. The computational complexity inherent to spatial scheduling generally prevents the use of optimization models to find solutions to larger, realistic problems in a reasonable time. Accordingly, two classes of approximation algorithms were developed: greedy heuristics for finding fast, feasible solutions; and hybrid meta-heuristic algorithms to search for near-optimal solutions. A flexible hybrid algorithm framework was developed, and a number of hybrid algorithms were devised from this framework that employ local search and several varieties of simulated annealing. Extensive computational experiments showed these hybrid meta-heuristic algorithms to be effective in finding high-quality solutions over a wide variety of problems. Hybrid algorithms based on local search generally provided both the best-quality solutions and the greatest consistency." @default.
- W10028645 created "2016-06-24" @default.
- W10028645 creator A5054798706 @default.
- W10028645 creator A5078578115 @default.
- W10028645 date "2010-01-01" @default.
- W10028645 modified "2023-09-23" @default.
- W10028645 title "Optimization models and algorithms for spatial scheduling" @default.
- W10028645 doi "https://doi.org/10.25777/zm3n-p489" @default.
- W10028645 hasPublicationYear "2010" @default.
- W10028645 type Work @default.
- W10028645 sameAs 10028645 @default.
- W10028645 citedByCount "2" @default.
- W10028645 countsByYear W100286452014 @default.
- W10028645 crossrefType "journal-article" @default.
- W10028645 hasAuthorship W10028645A5054798706 @default.
- W10028645 hasAuthorship W10028645A5078578115 @default.
- W10028645 hasConcept C102370290 @default.
- W10028645 hasConcept C107568181 @default.
- W10028645 hasConcept C111919701 @default.
- W10028645 hasConcept C119948110 @default.
- W10028645 hasConcept C126255220 @default.
- W10028645 hasConcept C127456818 @default.
- W10028645 hasConcept C206729178 @default.
- W10028645 hasConcept C31689143 @default.
- W10028645 hasConcept C33923547 @default.
- W10028645 hasConcept C41008148 @default.
- W10028645 hasConcept C55416958 @default.
- W10028645 hasConcept C68387754 @default.
- W10028645 hasConceptScore W10028645C102370290 @default.
- W10028645 hasConceptScore W10028645C107568181 @default.
- W10028645 hasConceptScore W10028645C111919701 @default.
- W10028645 hasConceptScore W10028645C119948110 @default.
- W10028645 hasConceptScore W10028645C126255220 @default.
- W10028645 hasConceptScore W10028645C127456818 @default.
- W10028645 hasConceptScore W10028645C206729178 @default.
- W10028645 hasConceptScore W10028645C31689143 @default.
- W10028645 hasConceptScore W10028645C33923547 @default.
- W10028645 hasConceptScore W10028645C41008148 @default.
- W10028645 hasConceptScore W10028645C55416958 @default.
- W10028645 hasConceptScore W10028645C68387754 @default.
- W10028645 hasLocation W100286451 @default.
- W10028645 hasOpenAccess W10028645 @default.
- W10028645 hasPrimaryLocation W100286451 @default.
- W10028645 hasRelatedWork W1562025755 @default.
- W10028645 hasRelatedWork W1626050793 @default.
- W10028645 hasRelatedWork W1979928555 @default.
- W10028645 hasRelatedWork W2122197714 @default.
- W10028645 hasRelatedWork W2298792569 @default.
- W10028645 hasRelatedWork W2399918251 @default.
- W10028645 hasRelatedWork W2523470351 @default.
- W10028645 hasRelatedWork W2811024230 @default.
- W10028645 hasRelatedWork W2888934659 @default.
- W10028645 hasRelatedWork W2899658725 @default.
- W10028645 hasRelatedWork W2952210615 @default.
- W10028645 hasRelatedWork W2964984777 @default.
- W10028645 hasRelatedWork W2967290623 @default.
- W10028645 hasRelatedWork W2975873288 @default.
- W10028645 hasRelatedWork W3098326450 @default.
- W10028645 hasRelatedWork W3120290080 @default.
- W10028645 hasRelatedWork W3121758120 @default.
- W10028645 hasRelatedWork W3122162113 @default.
- W10028645 hasRelatedWork W3133821530 @default.
- W10028645 hasRelatedWork W3161959338 @default.
- W10028645 isParatext "false" @default.
- W10028645 isRetracted "false" @default.
- W10028645 magId "10028645" @default.
- W10028645 workType "article" @default.