نتایج جستجو برای: parallel machine scheduling
تعداد نتایج: 529014 فیلتر نتایج به سال:
In this research, robotic cell scheduling problem with three CNC machines and with an operation on each machine with the purpose of optimizing manufacturing cost and time in S1 cycle has been investigated. To obtain the optimal total cost of production has been used the optimal processing time on machine operation. In this research, robotic cell scheduling is studied in three different situatio...
This paper addresses the application of AI techniques in a practical OR problem , i.e. scheduling. Scheduling is a scientific domain concerning the allocation of tasks to a limited set of resources over time. The goal of scheduling is to maximize (or minimize) different optimization criteria such as the makespan (i.e. the completion time of the last operation in the schedule), the occupation ra...
Athapascan-1 is a C++ library for multi-threaded parallel programming. It implements a macro data-ow language: both computation and data grains are explicit. Semantics of shared memory access is based on a lexicographic order. The performance of a code (parallel time, communication and arithmetic works, space) can be evaluated from a cost model without need of a machine model. Its important fea...
scheduling is an important subject of production and operations management area. in flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. the concept of transportation time is very important in scheduling. transportation can be done by robots. in situations that robots are used to transpor...
Abstract We deal with a challenging scheduling problem on parallel machines sequence-dependent setup times and release dates from real-world application of semiconductor work-shop production. There, jobs can only be processed by dedicated machines, thus few determine the makespan almost regardless how are scheduled remaining ones. This causes problems when fail need to rescheduled. Instead opti...
We study classic machine sequencing problems in an online setting. Specifically, we look at deterministic and randomized algorithms for the problem of scheduling jobs with release dates on identical parallel machines, to minimize the sum of weighted completion times: Both preemptive and non-preemptive versions are analyzed. Using linear programming techniques, borrowed from the single machine c...
In this paper, we describe adaptation techniques for a hierarchically organized multi-agent-system (MAS) applied to production control of complex job shops. The system architecture of the production control system is based on three different control layers. The mid layer implements a distributed shifting bottleneck type solution procedure. The shifting bottleneck heuristic decomposes the overal...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید