نتایج جستجو برای: surgery scheduling problem

تعداد نتایج: 1256511  

Journal: :Discrete Applied Mathematics 1985

Journal: :Journal of Artificial Intelligence Research 2019

Journal: :AIRO Springer series 2023

With the increase in world population, efficient production of food becomes an ever more important goal. One particular tasks associated with this goal is to find optimal crop planting time, considering allowed time windows and following objectives: (1) weekly harvest must not surplus available storage capacity produce waste, (2) labor force should be utilized manner. To tackle problem, we defi...

Journal: :Information and Computation 2003

Journal: :Journal of Algorithms 2000

Journal: :journal of quality engineering and production optimization 2015
mostafa khatami hessameddin zegordi

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...

Journal: :journal of optimization in industrial engineering 2010
hassan rashidi edward p.k tsang

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...

  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...

Journal: :journal of modern processes in manufacturing and production 2014
mohammadreza naghibi abolfazl adressi

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...

Amin-Naseri, , Mohammad Reza , Mokhtari, Hadi , Nakhai Kamal Abadi, Isa ,

  The project scheduling problem is known as a NP-hard problem in literature. In this research, a resource constrained project scheduling problem which is known as a NP-Hard problem is considered. This problem has attracted many researchers during recent years. The aim of this problem is to determine the optimal starting times of activities considering both precedence and available resources co...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید