نتایج جستجو برای: gate scheduling problem
تعداد نتایج: 963286 فیلتر نتایج به سال:
Passengers’ experience is becoming a key metric to evaluate the air transportation system’s performance. Efficient and robust tools to handle airport operations are needed along with a better understanding of passengers’ interests and concerns. Among various airport operations, this paper studies airport gate scheduling for improved passengers’ experience. Three objectives accounting for passen...
this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...
in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...
Passengers’ experience is becoming a key metric to evaluate the air transportation system’s performance. Efficient and robust tools to handle airport operations are needed along with a better understanding of passengers’ interests and concerns. This paper is concerned with airport gate scheduling for improved passenger experience while ensuring robust air-side operations. Three metrics accounti...
Two optimal algorithmic schemes (GPRA and SPRA) for scheduling a chain of n coarse-grained tasks on a linear array of k recon gurable FPGAs are presented. Each scheme supports several realistic problem formulations and cost functions. GPRA, the more general of the two schemes, reduces the problem to computing a shortest path in a DAG and requires O(nk4) time and O(n4) storage; SPRA, the less ge...
This investigation considers a reentrant permutation flowshop scheduling problem whose performance criterion is maximum tardiness. The reentrant flowshop (RFS) is a natural extension of the classical flowshop by allowing a job to visit certain machines more than once. The RFS scheduling problem, in which the job order is the same for each machine in each layer, is called a reentrant permutati...
nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. in some of the applications of unrelated parallel mac...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید