We study galaxies undergoing ram pressure stripping in the Virgo cluster to examine whether we can identify any discernible trend in their star formation activity. We first use 48 galaxies undergoing different stages of stripping based on Hi morphology, Hi deficiency, and relative extent to the stellar disk, from the VIVA survey. We then employ a new scheme for galaxy classification which combines Hi mass fractions and locations in projected phase space, resulting in a new sample of 365 galaxies. We utilize a variety of star formation tracers, which include g - r, WISE [3.4]-[12] colors, and starburstiness that are defined by stellar mass and star formation rates to compare the star formation activity of galaxies at different stripping stages. We find no clear evidence for enhancement in the integrated star formation activity of galaxies undergoing early to active stripping. We are instead able to capture the overall quenching of star formation activity with increasing degree of ram pressure stripping, in agreement with previous studies. Our results suggest that if there is any ram pressure stripping induced enhancement, it is at best locally modest, and galaxies undergoing enhancement make up a small fraction of the total sample. Our results also indicate that it is possible to trace galaxies at different stages of stripping with the combination of Hi gas content and location in projected phase space, which can be extended to other galaxy clusters that lack high-resolution Hi imaging.

Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.