نتایج جستجو برای: open shop with no buffer
تعداد نتایج: 10478941 فیلتر نتایج به سال:
This paper presents a model for a dock assignment problem, where trailers need to be assigned to gates for a given period of time for loading or unloading activities. The parking lot is used as a buffer zone. Transportation between the parking lot and the gates is performed by additional resources called terminal tractors. The problem is modeled as a three-stage flexible flow shop, where the fi...
This is a summary of the PhD thesis defended by the author in September 2011 at thé Ecole des Mines de Nantes (EMNantes). The thesis was advised by Narendra Jussien (EMNantes) and co-advised by Louis-Martin Rousseau (´ Ecole Polytechnique de Montréal – Poly), Christelle Guéret (EMNantes) and André Langevin (Poly). The manuscript is written in French and can be obtained from The focus of the dis...
One of the main restrictions in scheduling problems are the machine (resource) restrictions: each machine can perform at most one job at a time. We explore machine dependencies is shop scheduling problems representing them as graphs. Our study shows that the structure of machine dependency graphs is important in the complexity analysis of shop scheduling problems. We call acyclic a shop schedul...
This paper considers a scheduling problem in which a single operator completes a set of n jobs requiring operations on two machines. The operator can perform only one operation at a time, so when one machine is in use the other is idle. After developing general properties of optimal schedules, the paper develops e cient algorithms for minimizing maximum lateness. The algorithm has time complexi...
Today, the flow shop environment is the most customary production area in industry. But, the need to increase the capacity or the capacity balance in different production processes has caused that in some working stations there exists more than one machine. This type of flow shops are usually named hybrid flow shop, multi processes flow shop, flexible flow shop or flow shop with parallel machin...
The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach which produces reasonably good results very quickly on standard benchmark job-shop scheduling problems, better than previous eeorts using genetic algorithms for this task, and comparable to existing conventional search-based methods. The representation used is a variant of one known to work moderate...
The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach which produces reasonably good results very quickly on standard benchmark job-shop scheduling problems, better than previous eeorts using genetic algorithms for this task, and comparable to existing conventional search-based methods. The representation used is a variant of one known to work moderate...
utopia has, for four centuries, accompanied that hope of progress and that striving for betterment. it now straggles against a widespread sense that this has been an illusion, or an impossible dream. the utopian idea can never entirely disappear, but utopia as a form of the social imagination has clearly weakened. if it cannot instill its vision in the public consciousness, the consequences...
Mixed Integer Linear Programs for Blocking and No Wait Job Shop Scheduling Problems in Robotic cells
This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Pr...
Mixed Integer Linear Programs for Blocking and No Wait Job Shop Scheduling Problems in Robotic cells
This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Pr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید