نتایج جستجو برای: starting problem
تعداد نتایج: 972665 فیلتر نتایج به سال:
DOI: 10.1002/advs.201700872 Who would have believed it? When we launched Advanced Science in December 2014, everyone in the editorial team agreed that it was a fantastic idea to create a forum for top science, open to read, download, and share with everyone, but the development that this young journal has undergone during the last three years has stunned even the most optimistic among us. Figur...
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...
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
The membership committee of the American Academy of Pedodontics is endeavoring to provide information to new pedodontists about starting a practice. This article in,dudes several factors to consider in preparing a practice. They are: 1. Choosing a dental practice arrangement 2. Selecting and planning a solo practice 3. Choosing an area 4. Choosing a practice facility 5. Finding support services...
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formulation, our goal is to assert possible and necessary criticality of the different tasks and to compute their possible earliest starting dates, latest starting dates and floats. This paper puts together various results ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید