نتایج جستجو برای: scheduling problems

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

Nowadays, nurses scheduling is one of the most important challenges with which health care centers are encountered. The significance of nurses’ work quality has led researchers to be concerned about scheduling problems, which have an impact on nurses’ performance. Observing the interests of hospital and patients, providing their satisfaction, and meeting their needs are among the main objective...

The group scheduling problem in the cellular manufacturing system is comprised of two levels of scheduling. At the first level, the sequence of parts in each part-family is determined, and then at the second level the sequence of part-families is determined. In this paper, the flow shop group scheduling is investigated in order to minimize the makespan. In traditional group scheduling problems,...

Mohammad Reza Abassi Mohsen Garmsiri

In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activit...

Journal: :journal of optimization in industrial engineering 2014
mohammad saidi mehrabad saeed zarghami

this paper presented a mixed integer programming for integrated scheduling and process planning. the presented process plan included some orders with precedence relations similar to multiple traveling salesman problem (mtsp), which was categorized as an np-hard problem. these types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

Journal: :Mathematical and Computer Modelling 2004
Volker Lauff Frank Werner

The just-in-time production philosophy has led to a growing interest in scheduling problems considering both earliness and tardiness penalties. Most publications considering these so-called non-regular objective functions are devoted to single machine problems. In the case of multi-machine problems, there are some papers dealing with parallel machine problems. However, for multi-operation sched...

The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...

Journal: :the international journal of humanities 2007
babak sohrabi babak abedin

in this paper, we investigate a decision support system (dss) for the resolution of real-life vehicle routing and scheduling problem (vrsp). scheduling the deliveries from a regional distribution centre (rdc) to large stores of a major fmcg retailer includes every possible vehicle routing complexity. usual constraints that are seen are: size of the vehicle and the length of the driving day, loa...

Background and Objectives: Operating room (OR) scheduling is key to optimal operating room productivity. The significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. This paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. The model considers various surgical operation co...

Journal: :journal of optimization in industrial engineering 2012
behrouz afshar nadjafi amir rahimi hamid karimi

in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...

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

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