Sequencing and scheduling are forms of decision making which play a key role in manufacturing. This paper presents the description of a scheduling algorithm for the solution of the no-wait ̄ow-shop problem. The goal of the heuristic is to minimise the sum of the total ̄owtimes, a criterion which at the same time minimises the average processing time. This is a sensible target in applications su...

background: long wait time interval in emergency department (ed) of hospitals, from the patients’ point of view in ed is a major problem causing patients’ dissatisfaction and may result increasing in patient morbidity and indirectly nurses dissatisfaction. evaluation of wait time intervals in ed and giving nursing feedback may improve the quality of services, as well as patient satisfaction. th...

A no-wait robotic cell is an automated ow shop in which a robot is used to move the parts from a machine to the next. Parts are not allowed to wait. We analyze the complexity of the part sequencing problem in a robotic cell with three machines, for di erent periodical patterns of robot moves, when the objective is productivity maximization. c © 2000 Elsevier Science B.V. All rights reserved.

Studies of the reproductive biology of the nematode Caenorhabditis elegans are providing valuable insights into the evolution and diversity of reproductive strategies [1,2]. The successful production of progeny in any species also highlights many fundamental problems in cell biology. Research on the amoeboid sperm of nematodes addresses a number of issues of broad biological significance, inclu...

Due to the low risk of not insuring a healthy child for a short, finite period of time, it’s plausible that SCHIP mandatory wait periods, where a child must forgo private insurance for several months before enrolling in SCHIP, do not provide enough incentive for parents to keep their children enrolled in private insurance. Using data from the 1996 Survey of Income and Program Participation (SIP...

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

A proper edge-coloring of a graph is an interval coloring if the labels on edges incident to any vertex form interval, that is, set consecutive integers. The thickness θ ( G ) $\theta (G)$ $G$ smallest number colorable graphs edge-decomposing . We prove = o n (G)=o(n)$ for $n$ vertices. This improves previously known bound 2 ⌈ ∕ 5 ⌉ $2\lceil n\unicode{x02215}5\rceil $ , see Asratian, Casselgren...