نتایج جستجو برای: unrelated parallel machines

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

Journal: :Isij International 2021

This paper studies the problem of scheduling N jobs in a hybrid flowshop with unrelated parallel machines at each stage. Considering practical application presented problem, no-wait constraints and objective function total flowtime are included problem. A mathematical model is constructed novel genetic simulated annealing algorithm so-called GSAA developed to solve this In algorithm, firstly mo...

2015
Ze Tao Xiaoxia Liu Pengfei Zeng

A new hybrid flow shop scheduling problem with blocking is studied. The problem is characterized by multistage unrelated parallel machines and no intermediate buffer. Firstly, the math model of the hybrid scheduling problem is constructed. And then the computation method of production period is given. Due to there is no intermediate buffer, and there are unrelated parallel machines in multi-sta...

In this paper the problem of job shop scheduling with parallel machines in each stages is discussed. The objective is to minimize the maximum completion time (makespan).This problem is a combination of two classic problems of job shop and parallel machines which in this case parallel machines has been used as kind of flexibility in the job shop problem. The review of literature has shown that t...

2015
Jibo Wang Chou-Jung Hsu J. B. Wang C.-J. Hsu

In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting) time, total absolute differences in completion (waiting) times respectively. If the number of machines is fixed, these problems can be solved in m O n 2 ( ) + time respectively, w...

Journal: :European Journal of Operational Research 2010
Luis Fanjul-Peyro Rubén Ruiz

This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel machines problem. Similarly to most of the literature, this paper deals with the minimization of ...

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...

Journal: :Oper. Res. Lett. 2016
Maciej Drwal Roman Rischke

In this paper we consider the problem of scheduling jobs on parallel identical machines, where the processing times of jobs are uncertain: only interval bounds of processing times are known. The optimality criterion of a schedule is the total completion time. In order to cope with the uncertainty we consider the maximum regret objective and we seek a schedule which performs well under all possi...

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

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