نتایج جستجو برای: open shop with no buffer
تعداد نتایج: 10478941 فیلتر نتایج به سال:
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...
Abstract This paper introduces a new concept to solve car sequencing problem called the Car Sequencing Problem 4.0, focuses paint shop. The of effective in shop is caused by specifics production process itself and structure line. cars as required painting justified economically. main goal minimize number costly changeovers guns because color changes synchronize those with periodic cleanings, fo...
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...
This paper deals with multi-operation models, which are different from the flow shop and job shop models. In the flow shop or job shop models, the routes of all jobs are known in advance. In practice, the route of the job is often immaterial and up to the scheduler to decide. When the routes of the jobs are open, the model is referred to as an open shop. This paper describes the development of ...
In this paper we deal with solution algorithms for a general formulation of the job shop problem, called alternative graph. We study in particular the job shop scheduling problem with blocking and/or no-wait constraints. Most of the key properties developed for solving the job shop problem with infinite capacity buffer do not hold in the more general alternative graph model. In this paper we re...
This paper takes a game theoretical approach to open shop scheduling problems minimize the sum of completion times. We assume that there is an initial schedule process jobs (consisting number operations) on machines and each job owned by different player. Thus, we can associate cooperative TU-game any problem, assigning coalition maximal cost savings it obtain through admissible rearrangements ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید