SwePub
Tyck till om SwePub Sök här!
Sök i LIBRIS databas

  Extended search

hsv:(NATURVETENSKAP) hsv:(Matematik) hsv:(Beräkningsmatematik)
 

Search: hsv:(NATURVETENSKAP) hsv:(Matematik) hsv:(Beräkningsmatematik) > Mathematical Multi-...

Mathematical Multi-Objective Optimization of the Tactical Allocation of Machining Resources in Functional Workshops

Fotedar, Sunney, 1989 (author)
Chalmers tekniska högskola,Chalmers University of Technology
 (creator_code:org_t)
ISBN 9789179059026
Gothenburg, 2023
English.
  • Doctoral thesis (other academic/artistic)
Abstract Subject headings
Close  
  • In the aerospace industry, efficient management of machining capacity is crucial to meet the required service levels to customers and to maintain control of the tied-up working capital. We introduce new multi-item , multi-level capacitated resource allocation models with a medium--to--long--term planning horizon. The model refers to functional workshops where costly and/or time- and resource-demanding preparations (or qualifications) are required each time a product needs to be (re)allocated to a machining resource. Our goal is to identify possible product routings through the factory which minimize the maximum excess resource loading above a given loading threshold while incurring as low qualification costs as possible and minimizing the inventory. In Paper I , we propose a new bi-objective mixed-integer (linear) optimization model for the Tactical Resource Allocation Problem (TRAP). We highlight some of the mathematical properties of the TRAP which are utilized to enhance the solution process. In Paper II , we address the uncertainty in the coefficients of one of the objective functions considered in the bi-objective TRAP. We propose a new bi-objective robust efficiency concept and highlight its benefits over existing robust efficiency concepts. In Paper III , we extend the TRAP with an inventory of semi-finished as well as finished parts, resulting in a tri-objective mixed-integer (linear) programming model. We create a criterion space partitioning approach that enables solving sub-problems simultaneously. In Paper IV , using our knowledge from our previous work we embarked upon a task to generalize our findings to develop an approach for any discrete tri-objective optimization problem. The focus is on identifying a representative set of non-dominated points with a pre-defined desired coverage gap .

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)
NATURVETENSKAP  -- Matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics (hsv//eng)
NATURVETENSKAP  -- Matematik -- Beräkningsmatematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Computational Mathematics (hsv//eng)
NATURVETENSKAP  -- Matematik -- Annan matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Other Mathematics (hsv//eng)
NATURVETENSKAP  -- Matematik -- Diskret matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Discrete Mathematics (hsv//eng)

Keyword

Decision-making
Robust efficient solutions
Discrete bi-objective optimization
Capacity planning
Discrete tri-objective optimization
Production planning
Coverage gap

Publication and Content Type

dok (subject category)
vet (subject category)

Find in a library

To the university's database

Find more in SwePub

By the author/editor
Fotedar, Sunney, ...
About the subject
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Mechanical Engin ...
and Production Engin ...
NATURAL SCIENCES
NATURAL SCIENCES
and Mathematics
NATURAL SCIENCES
NATURAL SCIENCES
and Mathematics
and Computational Ma ...
NATURAL SCIENCES
NATURAL SCIENCES
and Mathematics
and Other Mathematic ...
NATURAL SCIENCES
NATURAL SCIENCES
and Mathematics
and Discrete Mathema ...
By the university
Chalmers University of Technology

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view