Sökning: "flexible job shop scheduling"

Hittade 3 avhandlingar innehållade orden flexible job shop scheduling.

  1. 1. Scheduling for production systems

    Författare :Torbjörn Liljenvall; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; heuristics; job-shop; limited buffers; A*; deadlock; multi purpouse batch plants; scheduling; flexible manufacturing systems; petri net; automata;

    Sammanfattning : .... LÄS MER

  3. 2. Mathematical Optimization in Flexible Job Shop Scheduling: Modelling, Analysis, and Case Studies

    Författare :Karin Thörnblad; Göteborgs universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Flexible job shop scheduling; Mixed integer linear programming MILP ; Time-indexed formulation; Makespan; Tardiness; Fixture availability; Preventive maintenance; Night shift; Unmanned time window; Dynamic scheduling; Priority rules; Dispatching rules; Critical ratio; Night shift;

    Sammanfattning : The major theme of this thesis is the mathematical optimization modelling of the flexible job shop scheduling problem. This problem is present in the so-called multitask cell—a production cell at GKN Aerospace's facility located in Trollhättan, Sweden—which has served as a case study during the work with this thesis. LÄS MER

  4. 3. On the Optimization of Schedules of a Multitask Production Cell

    Författare :Karin Thörnblad; Göteborgs universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; mathematical optimization; flexible job shop scheduling; mixed integer linear programming MILP ; complexity analysis; mathematical modelling; production planning; multi-purpose machine; dispatching rule; priority function; total flowtime; total tardiness; release date; due date; due date;

    Sammanfattning : Volvo Aero has invested in a complex production cell containing a set of multipurpose machines. The problem of finding optimal schedules for this multitask cell is a complex combinatorial optimization problem which is recognized as a flexible job shop problem. This thesis proposes an approach to find such schedules using mathematical optimization. LÄS MER