نتایج جستجو برای: no idle hybrid flow shops
تعداد نتایج: 3819043 فیلتر نتایج به سال:
We consider a problem of scheduling jobs in two-machine no-wait ow shops for which the objective is to minimize the makespan. Each job, upon completion of its processing on the rst machine, must be transferred immediately to the second machine due to a no-wait in process constraint. Every job requires a setup time on each machine before it is processed. The setup on the second machine is antici...
This paper addresses the problem of minimizing the makespan on a two-stage parallel flow shops with proportional processing times. The problem of scheduling n independent jobs on m proportional parallel flow shops to minimize makespan is known to be NP-hard and hence too difficult to solve in polynomial time. A multiphase heuristic algorithm to minimize the makespan on two proportional parallel...
Global warming and climate change are threatening life on earth. These changes due to human activities resulting in the emission of greenhouse gases. This is caused by intensive industrial excessive fuel energy consumption. Recently, scheduling production systems has been judged be an effective way reduce field green scheduling, which aims allocate jobs machines order minimize total costs, with...
In this paper, an invasive weed optimization (IWO) scheduling algorithm is presented for optimization no-idle flow-shop scheduling problem (NFSP) with the criterion to minimize the maximum completion time (makespan). Firstly, a simple approach is put forward to calculate the makespan of job sequence. Secondly, the most position value (MPV) method is used to code the weed individuals so that fit...
This paper considers some permutation flow shop scheduling problems with a learning effect on no-idle dominant machines. The objective is to minimize maximum completion time. This objective is considered under following dominant machines constraint: idm, ddm, idm–ddm and ddm–idm. We present a polynomial-time solution algorithm for each of the above cases. 2006 Elsevier Inc. All rights reserved.
In this paper, we address the problem of production systems having two characteristics. First, the manufacturing times can be chosen between given bounds. Such a production system is said to have controllable processing times. Second, an operation must start as soon as the previous operation on the same part (if any) is completed. A production system having this characteristic is said to be no-...
The global competition imposes minimizing the time-to-market and cost parameters, simultaneously increasing products quality and response to the customer demands. Information sharing, concurrent engineering and virtual enterprising prove to be stringent necessities in order to optimally achieve a better product design in an appropriate time. Automatically choosing the best products (accepting t...
We investigate the approximability of no-wait permutation flow shop scheduling problem under the makespan criterion. We present a polynomial time approximation scheme (PTAS) for problem on any fixed number of machines.
The no idle permutation flow shop scheduling problem (NIPFSP) is a popular NP-hard combinatorial optimization problem, which exists in several real world production processes. This study proposes a novel hybrid estimation of the distribution algorithm and cuckoo search (CS) algorithm (HEDA_CS) to solve the NIPFSP with the total tardiness criterion minimization. The problem model is built on the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید