An efficient algorithm for solving the flexible job shop scheduling problem
Paper in proceeding, 2013

Purpose: To investigate the efficiency of a discretization procedure utilizing a time-indexed mathe-matical optimization model for finding accurate solutions to flexible job shop scheduling problems considering objectives comprising makespan and tardiness, respectively. Design/methodology/approach: A time-indexed mixed integer programming model is used to find solutions by iteratively employing time steps of decreasing length. The solutions and computation times are compared with results from a known benchmark formulation and an alternative model. Findings: The proposed method finds significantly better solutions for the largest instances within the same time frame. Both the other models are better choices for some smaller instances, which is expected since the new method is designed for larger problems. Only our alter-native model is able to solve two of the largest instances when minimizing the tardiness. Research limitations/implications: Interesting future research topics include the introduction of constraints representing other relevant entities such as the availability of tools and fixtures, and the scheduling of maintenance activities and personnel. Practical implications: Real cases of flexible job shop problems typically yield very large models. Since the new procedure quickly finds solutions of good quality to such instances, our findings imply that the new procedure is beneficially utilized for scheduling real flexible job shops. Original/value: We show that real flexible job shop problems can be solved through the solution of a series of carefully formulated discretized mathematical optimization models.

Linear integer optimization

Benchmarking

Discretization procedure

Tardiness

Linear mixed integer programming

Minimize makespan

Flexible job shop scheduling

Author

Karin Thörnblad

GKN Aerospace Sweden

Ann-Brith Strömberg

Chalmers, Mathematical Sciences, Mathematics

University of Gothenburg

Michael Patriksson

Chalmers, Mathematical Sciences

University of Gothenburg

Torgny Almgren

GKN Aerospace Sweden

25th NOFOMA conference proceedings, June 3-5 2013, Göteborg, Sweden

15-

Production planning facilitated by optimal scheduling of a multi-task production cell

VINNOVA, 2008-01-01 -- 2013-10-31.

GKN Aerospace Sweden, 2008-01-01 -- 2013-10-31.

Swedish Research Council (VR), 2008-01-01 -- 2012-12-31.

Subject Categories

Production Engineering, Human Work Science and Ergonomics

Computational Mathematics

Roots

Basic sciences

More information

Latest update

3/7/2023 1