نتایج جستجو برای: stage assembly flowshop

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

The strategic pricing decisions of assembly products in assembly products supply chain are studied in this paper. Firstly, a two-stage assembly products supply chain model is developed. By building Nash game model, the Nash equilibrium solution of pricing strategy of supplier and assemblers is obtained. Next, a union decision model is built to analyze the optimal combination pricing strategy of...

2013
Neelam Tyagi

In the field of scheduling, the flowshop problems have been thoroughly studied over the last six decades. In this paper we propose a concise overview of flowshop scheduling techniques evolved during this period. We surveyed the exact, heuristics and metaheuristics methods for solving various flowshop scheduling problems. As a result various optimization techniques, solution procedures are avail...

Scheduling problem for the hybrid flow shop scheduling problem (HFSP) followed by an assembly stage considering aging effects additional preventive and maintenance activities is studied in this paper. In this production system, a number of products of different kinds are produced. Each product is assembled with a set of several parts. The first stage is a hybrid flow shop to produce parts. All ...

Journal: :J. Intelligent Manufacturing 2014
Andrea Rossi Michele Lanzetta

The most general flowshop scheduling problem is also addressed in the literature as nonpermutation flowshop (NPFS). Current processors are able to cope with the (n!) m combinatorial complexity of non-permutation flowshop scheduling by metaheuristics. After briefly discussing the requirements for a manufacturing layout to be designed and modeled as non-permutation flowshop, a disjunctive graph (...

Journal: :International Journal of Applied Physics and Mathematics 2012

Journal: :journal of industrial engineering, international 2011
l mahdavi v zarezadeh p shahnazari-shahrezaei

this article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. the objective is to minimize the makespan for a given set of jobs in the system. this problem class is np-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. a number of test problems are randomly ge...

2005
Jitti Jungwattanakit Manop Reodecha Paveena Chaovalitwongse Frank Werner

This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively weighted convex sum of makespan and the number ...

Journal: :journal of optimization in industrial engineering 2011
yong luo shuwei chen

the strategic pricing decisions of assembly products in assembly products supply chain are studied in this paper. firstly, a two-stage assembly products supply chain model is developed. by building nash game model, the nash equilibrium solution of pricing strategy of supplier and assemblers is obtained. next, a union decision model is built to analyze the optimal combination pricing strategy of...

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

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

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