• No results found

Permutation flow shop problem (PFSP)

A Two Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow Shop Scheduling Problem

A Two Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow Shop Scheduling Problem

... pioneered permutation flow-shop problem research in ...the flow-shop scheduling problem (PFSP), an NP-hard problem, has received increasing attention in the ...

8

An Evolutionary Approach for Solving the N Jobs M Machines Permutation Flow Shop Scheduling Problem with Break Down Times

An Evolutionary Approach for Solving the N Jobs M Machines Permutation Flow Shop Scheduling Problem with Break Down Times

... GAs are heuristics based on the natural process of evolution [13, 14]. These have been used to solve other combinatorial problems as the Travelling Salesman Problem (TSP) and Job- shop scheduling [15]. In ...

6

A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling

A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling

... the flow-shop scheduling ...hybrid flow shop (HFS) scheduling ...the permutation flow shop problem with make-span objective ...classical permutation ...

19

Analyzing a few Heuristic Algorithms Considering Machine Idle Time and Processing Time in Permutation Flow Shop Scheduling Problems

Analyzing a few Heuristic Algorithms Considering Machine Idle Time and Processing Time in Permutation Flow Shop Scheduling Problems

... Flow Shop Scheduling has been an interesting field of research for over six ...a shop, there are ‘m’ machines arranged in series to process a set of ‘n’ jobs having different processing ...The ...

9

A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling Problems

A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling Problems

... We proposed a hybrid (HGASA) meta-heuristic al- gorithm, which can be used for the minimization of makespan and total flow time in the PFSP. Hybridiza- tion indicates combining of two or more algorithms to solve a ...

11

Simulation Particle Swarm Optimisation for Stochastic Permutation Flow Shop Scheduling Problem under Different Disruptions

Simulation Particle Swarm Optimisation for Stochastic Permutation Flow Shop Scheduling Problem under Different Disruptions

... scheme of the Sim-Opt approach. Recently, in stochastic scheduling, the Sim-Opt is used where heuristics or meta- heuristics are applied for the optimisation part. The concept of Simulated Annealing (SA) algorithm has ...

5

Application of Simulated Annealing in Flow Shop Scheduling

Application of Simulated Annealing in Flow Shop Scheduling

... The problem of scheduling in permutation flow shops has been extensively investigated by many ...static permutation flow shop scheduling problems with the objectives of ...

10

Best First Heuristic Pruning Function for General Flow Shop Scheduling Problem

Best First Heuristic Pruning Function for General Flow Shop Scheduling Problem

... Here permutation sequences are prevailing, ...the problem size enhances [7], these techniques are computationally exhaustive for even very small size ...

11

Multi-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect

Multi-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect

... a permutation flow shop scheduling problem (PFSSP) with the modified Dejong's learning ...the problem is encoded with an appropriate rule to make the continuous nature of DE suitable ...

10

Migrating Birds Optimization for Flow Shop Sequencing Problem

Migrating Birds Optimization for Flow Shop Sequencing Problem

... Basic MBO algorithm is tested on quadratic assignment problems (QAP) [11]. Its structure resembles to genetic algorithm partially. While solving QAP problems, it is incorporated into problem permutation ...

6

A Proposed Method for Permutation Flow Shop Scheduling

A Proposed Method for Permutation Flow Shop Scheduling

... the permutation flow shop scheduling problem is ...scheduling problem is modified and extended to provide a solution for permutation flow of scheduling ...

5

On the n-job, m-machine permutation flow shop scheduling problems with makespan criterion and rework

On the n-job, m-machine permutation flow shop scheduling problems with makespan criterion and rework

... the problem of minimizing the makespan in a multi-product unrelated parallel machine scheduling problem with the possibility of producing imperfect ...

13

Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration

Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration

... with linear deteriorating jobs has attracted the attention of researchers. However, due to the computational complexity, there have been few studies in this class of problems having more than two machines. In this paper, ...

6

An Adjusted Intelligent Water Drop (AIWD) Algorithm in Flow Shop Scheduling Problem

An Adjusted Intelligent Water Drop (AIWD) Algorithm in Flow Shop Scheduling Problem

... the flow shop scheduling problems [4]. The flow shop scheduling problem being solved in this re- search was specialized on flow shop permutation scheduling to ...

7

GRASP to minimize total weighted tardiness in a permutation flow shop environment   Pages 161-176
		 Download PDF

GRASP to minimize total weighted tardiness in a permutation flow shop environment Pages 161-176 Download PDF

... In this phase, a feasible solution is iteratively constructed with an element at a time. The GRASP probabilistic component is characterized by randomly choosing one of the top best candidates (Restricted Candidate List - ...

16

Branch and Bound Technique in Flow Shop Scheduling Using Fuzzy Processing Times

Branch and Bound Technique in Flow Shop Scheduling Using Fuzzy Processing Times

... scheduling problem has attracted researchers from various fields. Permutation flow shop sequencing problems (PFSPs) have long been a topic of interest for the researchers & Practitioners ...

6

Download
			
			
				Download PDF

Download Download PDF

... to flow shop scheduling ...for flow shop scheduling can only be used to find the sequence of the jobs which optimizes the objective of interest but does not provide the value of the ...a ...

6

Solving Re-entrant No-wait Flow Shop Scheduling Problem

Solving Re-entrant No-wait Flow Shop Scheduling Problem

... In flow shop scheduling we assume that there exists a set of jobs J = ...this problem there are m machines in series that each of the tasks is to be processed in a specific route on the ...job. ...

10

Heuristics for no-wait flow shop scheduling problem   Pages 671-680
		 Download PDF

Heuristics for no-wait flow shop scheduling problem Pages 671-680 Download PDF

... The work in this paper presented an alternative constructive heuristic algorithm along with an improvement heuristic algorithm for solving no-wait permutation flow shop scheduling problems with the ...

10

Critical paths of non-permutation and permutation flow shop scheduling problems   Pages 281-298
		 Download PDF

Critical paths of non-permutation and permutation flow shop scheduling problems Pages 281-298 Download PDF

... NPFS problem after a first phase in which it produces a near-optimal PFS solution: different types of procedures are applied to improve this initial PFS ...the problem and its relation to the solution ...

18

Show all 10000 documents...

Related subjects