نتایج جستجو برای: flow shop batch processing machines
تعداد نتایج: 1040248 فیلتر نتایج به سال:
The purpose of this study is to develop an effective scheduling methodology for a realistic flow shop sequencing problem. The flow shop consists of two machines where only the first machine has separable, external, and sequence dependent setup times. The length of setup times required for a job depends not on the immediately preceding job but on the job which is two steps prior to it. The probl...
This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for t...
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...
In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate with no inserted idle time and no-wait schedules if tasks cannot wait between the end of an operation and the start of the following one. We consider here no-idle/no-wait shop scheduling problems with makespan as perfor...
We study the special case of the m machine ow shop problem in which the processing time of each operation of job j is equal to p j ; this variant of the ow shop problem is known as the proportionate ow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that...
This paper focuses on production scheduling in a semiconductor wafer fab producing multiple product types that have different due dates and different process flows. In the wafer fab, wafer lots are processed on serial and batch processing workstations, each of which consists of parallel identical machines. Machines in serial processing workstations process wafer lots one by one, while those in ...
This paper deals with the problem of optimization of job sequence in a two-machine flow shop problem in the presence of uncertainty. It is assumed that the processing times of jobs on the machines are described by triangular fuzzy sets. A new optimization algorithm based on Johnson’s algorithm for deterministic processing times and on an improvement of McCahon & Lee’s algorithm is developed and...
This paper presents an investigation of scheduling procedures to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop scheduling environment. The flexible flow shop problem is a scheduling of jobs in a flow shop environment consisting of series of production stages, some of which may have only one machine, but at least one ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید