نتایج جستجو برای: flexible job shop scheduling local search makespan meta heuristics teaching

تعداد نتایج: 1335570  

2014
Dominik ŻELAZNY

In this paper the flow shop scheduling problem with minimizing two criteria simultaneously is consider. Selected criteria are: makespan and the sum of tardiness of jobs. For each separate criteria the problem is strongly NP-hard, which makes it NP-hard as well. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but heuristics for multi-crite...

Journal: :Expert Syst. Appl. 2010
M. A. Adibi Mostafa Zandieh Maghsoud Amiri

Dynamic job shop scheduling that considers random job arrivals and machine breakdowns is studied in this paper. Considering an event driven policy rescheduling, is triggered in response to dynamic events by variable neighborhood search (VNS). A trained artificial neural network (ANN) updates parameters of VNS at any rescheduling point. Also, a multi-objective performance measure is applied as o...

2011
Jorge Puente Camino R. Vela Inés González Rodríguez

In the sequel, we propose a new neighbourhood structure for local search for the fuzzy job shop scheduling problem, which is a variant of the well-known job shop problem, where uncertain durations are modelled as fuzzy numbers and the objective is to minimise the expected makespan of the resulting schedule. The new neighbourhood structure is based on changing the position of a task in a critica...

In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...

2009
DAVORIN KOFJAČ MIROLJUB KLJAJIĆ

This paper presents a real case customized flexible furniture production optimization. Such a make-to-order production must be flexible to meet the customer’s needs, which are changing frequently. Hence, a frequent review of the production process is needed to ensure near-optimal production schedule to meet the minimal makespan constraint. In such a case we are confronted with a tradeoff betwee...

2012
A. Mehrsai A. Ait Alla

In the current paper, we study the concept of dynamic scheduling in flexible flow Shop with limited carrier under stochastic machine breakdowns and processing time. In most flexible flow shop scheduling methods reported in the literature consider a determinist environment, where all data of the problem are known in advance. Most of these works focused on the development of methods to produce a ...

2006
Christian Artigues Michel Gendreau Louis-Martin Rousseau

We propose a flexible model and several integer linear programming and constraint programming formulations for integrated employee timetabling and production scheduling problems. A hybrid constraint and linear programming exact method is designed to solve a basic integrated employee timetabling and job-shop scheduling problem for lexicographic minimization of makespan and labor costs. Prelimina...

Journal: :INFORMS Journal on Computing 1996

Journal: :journal of industrial engineering, international 2009
m.t taghavi-fard h.r dehnar saidy

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

Journal: :journal of industrial engineering, international 2006
parviz fattahi mohammad saidi mehrabad mir b. aryanezhad

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید