Till sidans topp

Sidansvarig: Webbredaktion
Sidan uppdaterades: 2012-09-11 15:12

Tipsa en vän
Utskriftsversion

A competitive iterative p… - Göteborgs universitet Till startsida
Webbkarta
Till innehåll Läs mer om hur kakor används på gu.se

A competitive iterative procedure using a time-indexed model for solving flexible job shop scheduling problems

Övrigt
Författare Karin Thörnblad
Ann-Brith Strömberg
Michael Patriksson
Torgny Almgren
Publiceringsår 2013
Publicerad vid Institutionen för matematiska vetenskaper
Institutionen för matematiska vetenskaper, matematik
Språk en
Länkar www.math.chalmers.se/Math/Research/...
Ämnesord Flexible job shop scheduling, Time-indexed formulation, Mixed integer linear programming (MILP), Discretization procedure, Benchmark, Minimize makespan, Tardiness
Ämneskategorier Tillämpad matematik, Optimeringslära, systemteori, Produktionsteknik, arbetsvetenskap och ergonomi

Sammanfattning

We investigate the efficiency of a discretization procedure utilizing a time-indexed mathematical optimization model for finding accurate solutions to flexible job shop scheduling problems considering objectives comprising the makespan and the tardiness of jobs, respectively. The time-indexed model is used to find solutions to these problems 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, slightly enhanced version of the same. For the largest instances---considering both objectives---the proposed method finds significantly better solutions than the other models within the same time frame, although there is a large difference in the performance of the models depending on which objective is considered. This implies that the evaluation of scheduling algorithms must be performed with respect to an objective that is suitable for the real application for which they are intended. The minimization of the makespan is no such objective, although it is the most widely used objective in research. We propose an objective incorporating tardiness. The iterative procedure for solving the time-indexed model outperforms the other models regarding the time to find the best feasible solution. We conclude that our iterative procedure with the time-indexed model is competitive with state-of-the-art mathematical optimization models. Since the proposed procedure quickly finds solutions of good quality to large instances, our findings imply that the new procedure is beneficially utilized for scheduling real flexible job shops.

Sidansvarig: Webbredaktion|Sidan uppdaterades: 2012-09-11
Dela:

På Göteborgs universitet använder vi kakor (cookies) för att webbplatsen ska fungera på ett bra sätt för dig. Genom att surfa vidare godkänner du att vi använder kakor.  Vad är kakor?