• No results found

Permutation flow shop

A Proposed Method for Permutation Flow Shop Scheduling

A Proposed Method for Permutation Flow Shop Scheduling

... Abstract - IN this paper, the permutation flow shop scheduling problem is considered. One of the established methods for two machine scheduling problem is modified and extended to provide a solution ...

5

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

... In permutation flow shop scheduling, ‘n’ jobs must be processed on ‘m’ machines in the same Order se- ...The permutation flow shop scheduling (PFSSP) has a broad foundation in ...

11

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

... Abstract. This paper addresses n-job, m-machine Permutation Flow Shop Scheduling Problem (PFSSP) with unlimited intermediate buers and rework activities. The concept of rework means that processing ...

13

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

... In this paper, a two-phase hybrid particle swarm optimization algorithm (PRHPSO) is proposed for the permutation flow- shop scheduling problem (PFSP) with the minimizing makespan measure. The ...

8

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

... typical permutation flow shop scheduling problem involves the determination of the order of processing the required jobs with different processing times over different ...

9

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

... Abstract—This paper considers the permutation flow shop scheduling problem (PFSP) under stochastic processing time and in the presence of different types of real-time events. A multi-objective ...

5

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

... a Permutation Flow Shop (PFS) environment, which is associated with many types of industries such as chemical, petrochemical, automobile manufacturing, metallurgical, textile, ...

16

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

... In this paper, we address the order acceptance problem with weighted tardiness in permutation flow shop scheduling. The problem is formulated as an integer-programming (IP) model, and a cloud-based ...

19

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

... In this paper a Genetic Algorithm (GA) approach is presented to solve the N-Jobs M-Machines Permutation Flow-Shop Scheduling Problem (PFSP) with Break-down times. In comparison with other methods ...

6

A Novel Hybrid Algorithm for Permutation Flow          Shop Scheduling

A Novel Hybrid Algorithm for Permutation Flow Shop Scheduling

... the permutation flow shop sequencing problem with the objective of makespan minimization using the new modified proposed method of johnson’s algorithm as well as the gupta’s heuristic ...

5

Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling   Pages 353-366
		 Download PDF

Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling Pages 353-366 Download PDF

... Permutation flow shop scheduling problems have been an interesting area of research for over six decades. Out of the several parameters, minimization of makespan has been studied much over the years. ...

14

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

... two-machine flow shop with deteriorating jobs via different objective ...mean flow time and developed a branch-and-bound procedure and several heuristic algorithms to search for the optimal solution ...

6

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

... a flow shop scheduling problem that is solved by simulated annealing, showing that NPFS schedules yield better results than PFS ...where flow shop batching with sequence-dependent family ...

18

A heuristic algorithm for scheduling in a flow shop environment to minimize makespan   Pages 173-184
		 Download PDF

A heuristic algorithm for scheduling in a flow shop environment to minimize makespan Pages 173-184 Download PDF

... for permutation flow shop scheduling problem including setup times with objective function of weighted sum of makespan and completion times of the ...in permutation flow shop ...

12

Flow shop scheduling using dual – bottleneck approach

Flow shop scheduling using dual – bottleneck approach

... Several studies place NEH as the best performing method. Direct evaluations against older methods are given in Taillard (1990) where NEH is shown to provide better results than other highly cited heuristics such as the ...

40

Application of Simulated Annealing in Flow Shop Scheduling

Application of Simulated Annealing in Flow Shop Scheduling

... in permutation flow shops has been extensively investigated by many ...static permutation flow shop scheduling problems with the objectives of minimizing the makespan or total ...

10

Using Max-Plus Algebra in The Flow Shop Scheduling

Using Max-Plus Algebra in The Flow Shop Scheduling

... ordering. Permutation flow shop is a special class of flow shop by which each job would have the same processing order in each ...of flow shop production is constructed in ...

5

SOME NOVEL METHODS FOR FLOW SHOP SCHEDULING

SOME NOVEL METHODS FOR FLOW SHOP SCHEDULING

... The permutation flow shop scheduling problem (PFSP) is one of the most well known and well studied production scheduling problems with strong industrial ...

9

Solving Re-entrant No-wait Flow Shop Scheduling Problem

Solving Re-entrant No-wait Flow Shop Scheduling Problem

... and flow time, and a heuristic for larger ...reentrant permutation flow-shop scheduling problem with different job reentrant ...multiprocessor flow shop scheduling problems in ...

10

On the Beat of the Drum:Improving the Flow Shop Performance of the Drum Buffer Rope Scheduling Mechanism

On the Beat of the Drum:Improving the Flow Shop Performance of the Drum Buffer Rope Scheduling Mechanism

... A first limitation of our study is that we have only considered one bottleneck position. The bottleneck position determines where in the routing of an order the bottleneck is located and consequently may have an impact ...

22

Show all 10000 documents...

Related subjects