Sökning: "integer programming"

Visar resultat 36 - 40 av 138 avhandlingar innehållade orden integer programming.

1. 36. Optimization of Just-in-Time Sequencing Problems and Supply Chain Logistics

   Författare :Gyan Thapa; Sergei Silvestrov; Anatoliy Malyarenko; George Fodor; Mälardalens högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Just-in-time; JIT sequencing; apportionment; product rate variation; output rate variation; algorithms; heuristics; supply chain; logistics; queueing; non-linear integer programming; Mathematics Applied Mathematics; matematik tillämpad matematik;

   Sammanfattning : This dissertation presents a comprehensive and comparative progress in sequencing approaches of mixed-model just-in-time (JIT) sequencing problem together with discrete apportioment problem (DAP). The goal of JIT sequencing problem (JITSP) is to keep the rate of usage of parts as constant as possible along the assembly lines, and the goal of DAP is to divide a given integer number of delegates proportionally among the states or the parties according to their population or votes. LÄS MER

3. 37. Exploring Processor and Memory Architectures for Multimedia

   Författare :Ali Iranpour; Institutionen för datavetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Multimedia; Computer Architecture; Mobile; Embedded Systems; constraint programming; Memory; Processing; optimal memory mapping;

   Sammanfattning : Multimedia has become one of the cornerstones of our 21st century society and, when combined with mobility, has enabled a tremendous evolution of our society. However, joining these two concepts introduces many technical challenges. LÄS MER

4. 38. Optimal Control of Electric Bus Lines

   Författare :Rémi Lacombe; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Eco-driving; Electric buses; Bus bunching; Nonlinear programming; Optimal control; Model predictive control;

   Sammanfattning : Bus lines are inherently unstable systems, where any delay tends to be further amplified by the accrued passenger loads encountered at stops downstream. This self-reinforcing mechanism, when combined with the multiple sources of disturbances of an urban environment, can lead to the problem of bus bunching. LÄS MER

5. 39. Analysis, synthesis and application of automaton-based constraint descriptions

   Författare :María Andreína Francisco Rodríguez; Justin Pearson; Pierre Flener; Christopher Jefferson; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint predicates; global constraints; automata; automaton-described constraint predicates; automaton-induced constraint decompositions; implied constraints; time-series constraints; transducers; automaton invariants; Computer Science; Datavetenskap;

   Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjunction of constraints on variables ranging over given initial domains, and optionally an objective function on the variables. Such a model is given to a general-purpose solver performing systematic search to find constraint-satisfying domain values for the variables, giving an optimal value to the objective function. LÄS MER

7. 40. Supply chain optimization in the forest industry

   Författare :Helene Gunnarsson Lidestam; Mikael Rönnqvist; Jan Lundgren; Eldon Gunn; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Supply chain; logistics; forestry; optimization; modelling; transportation; mixed integer programming models; försörjningskedjor; logistik; optimering; modellering; transportplanering; blandade heltalsproblem; skogsindustrin; Optimization; systems theory; Optimeringslära; systemteori;

   Sammanfattning : The scope of this thesis is modelling and solving large-scale planning problems in the supply chain within the forest industry. Five research papers are included, the first three of which focus on the modelling, and the last two on the solution methods. LÄS MER