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

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

2008
R. Tavakkoli-Moghaddam Hossein Mirzaei

A frequently occurring operational problem is one of processing a given number of jobs (commodities) on a specified number of machines (facilities) referred to by various investigators as scheduling, dispatching, sequencing, or combinations thereof (Gupta and Stafford, 2006). In most manufacturing environments, a set of processes is needed to be serially performed in several stages before a job...

1999
Haoxun Chen Jürgen Ihlow Carsten Lehmann

— Flexible Job Shop scheduling problem (FJSSP) is an important scheduling problem which has received considerable importance in the manufacturing domain. In this paper a genetic algorithm (GA) based scheduler is presented for flexible job shop problem to minimise makespan. The proposed approach implements a domain independent GA to solve this important class of problem. The scheduler is impleme...

2011
ROBIN KUMAR

The permutation flow shop scheduling problem (PFSP) is one of the most well known and well studied production scheduling problems with strong industrial background. Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and hence heuristics are used to obtain good solutions in a reasonable time. The specific goal of this paper is to inve...

Abbasian, Mohammad , Nahavandi, Nasim ,

In this paper, Multi-Objective Flexible Job-Shop scheduling with Parallel Machines in Dynamic manufacturing environment (MO-FDJSPM) is investigated. Moreover considering dynamical job-shop environment (jobs arrived in non-zero time), It contains two kinds of flexibility which is effective for improving operational manufacturing systems. The non-flexibility leads to scheduling program which have...

2013
Omid Gholami Yuri N. Sotskov Frank Werner

A train scheduling problem in a single-track railway can be modeled as a job-shop scheduling problem. We use a mixed graph model for such a job-shop problem with appropriate criteria. There are several performance evaluations for a train schedule. Optimizing a train schedule subtends minimizing total tardiness of the trains, minimizing the sum of train transit times, minimizing the makespan for...

Journal: :international journal of supply and operations management 2015
hadi mokhtari mehrdad dadgar

in this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. the main idea is that the processing times of operations may be controlled by consumptions of additional resources. the purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. the proposed model, flexibl...

Journal: :Measurement & Control 2023

A discrete whale optimization algorithm (DWOA) is presented to solve the no-wait flow shop scheduling problem (NWFSSP) with objective makespan. An effective combination of nearest neighbor (NN) and standard deviation heuristics (SDH) used acquire initial solutions population. After that, three crossover operators, two-point (TPX), multiple-point (MPX) job-based (JBX) are designed mimics humpbac...

1999
Benjamin P.C. YEN Guohua WAN

In the last decade, various approximation approaches, such as dispatching rules, shifting bottleneck heuristic and local search methods, are proposed for the job shop scheduling problem. As one of the local search methods, taboo search provides a promising alternative for the job shop scheduling problem; however, it has to be tailored each time with respect to parameters for every instance in o...

D. Rahmani, , M. Saidi-Mehrabad, , R. Ramezanian, ,

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...

Journal: :Computers & OR 2015
Juan José Palacios Miguel A. González Camino R. Vela Inés González Rodríguez Jorge Puente

This paper tackles the flexible job-shop scheduling problem with uncertain processing times. The uncertainty in processing times is represented by means of fuzzy numbers, hence the name fuzzy flexible job-shop scheduling. We propose an effective genetic algorithm hybridised with tabu search and heuristic seeding to minimise the total time needed to complete all jobs, known as makespan. To build...

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

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