نتایج جستجو برای: no wait
تعداد نتایج: 3306818 فیلتر نتایج به سال:
In this paper, the problem of finding an assignment “n” surgeries to be presented in one “m” identical operating rooms (ORs) or machines as surgical case scheduling (SCSP) is proposed. Since ORs are among NP-hard optimization problems, mathematical and metaheuristic methods address OR problems used. The job operation ordering any a permanent part all sequencing problems. transportation times be...
OBJECTIVE To examine the effects of Stepping Stones Triple P (SSTP) and Acceptance and Commitment Therapy (ACT) on child functioning, quality of life, and parental adjustment. METHOD 67 parents (97.0% mothers) of children (64.2% male; mean age 5.3 ± 3.0 years) with cerebral palsy participated in a randomized controlled trial with three groups: wait-list control, SSTP, and SSTP + ACT. This art...
This research tests people’s support for the ‘‘wait-and-see’’ approach in climate change due to the uncertainty in both the timing and probability of future consequences. In a laboratory experiment, carbon-tax consequences were presented to participants in one of two forms: a written description, where the probability, consequences, and timing were explicitly provided; and experience, where the...
OBJECTIVES Patients with thyroid pathology tend have longer surgical wait times. Uncertainty during this wait can have negative psychologically impact. This study aims to determine the degree of psychological morbidity in patients waiting for thyroid surgery. STUDY DESIGN Prospectively assessing patients pre- and postoperative psychological morbidity (level 2c). METHODS Patients waiting for...
A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are represe...
This paper studies the two-machine flowshop scheduling problem with class setups in a no-wait processing environment to minimize the maximum lateness. The jobs are divided into job classes and a setup is required at the initial processing of a job or between the processing of jobs of different classes. In a no-wait environment, a job must be processed from start to finish without interruptions ...
The flow shop scheduling with the no-wait constraint is a typical NP-hard combinatorial optimization problem and represents an important area in production scheduling. In this paper, a class of particle swarm optimization (PSO) approach with simulated annealing (SA) and hypothesis test (HT), namely PSOSAHT is proposed for the stochastic flow shop scheduling with no-wait constraint to minimize t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید