Scheduling jobs and a variable maintenance on a single machine with common due-date assignment.
Ontology highlight
ABSTRACT:
SUBMITTER: Wan L
PROVIDER: S-EPMC4132401 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in O(n(4)) time. For the model with job-independent position effects, we proved that the problems can be solved in O(n(3)) time by providing a dynamic programming algorithm.
| S-EPMC4167446 | biostudies-other
Project description:We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.
| S-EPMC4396807 | biostudies-other
Project description:We consider a single machine scheduling problem with multiple maintenance activities, where the maintenance duration function is of the linear form f(t) = a+bt with a ≥ 0 and b > 1. We propose an approximation algorithm named FFD-LS2I with a worst-case bound of 2 for problem. We also show that there is no polynomial time approximation algorithm with a worst-case bound less than 2 for the problem with b ≥ 0 unless P = NP, which implies that the FFD-LS2I algorithm is the best possible algorithm for the case b > 1 and that the FFD-LS algorithm, which is proposed in the literature, is the best possible algorithm for the case b ≤ 1 both from the worst-case bound point of view.
| S-EPMC3950368 | biostudies-other
Project description:Cell culturing is a basic experimental technique in cell biology and medical science. However, culturing high-quality cells with a high degree of reproducibility relies heavily on expert skills and tacit knowledge, and it is not straightforward to scale the production process due to the education bottleneck. Although many automated culture systems have been developed and a few have succeeded in mass production environments, very few robots are permissive of frequent protocol changes, which are often required in basic research environments. LabDroid is a general-purpose humanoid robot with two arms that performs experiments using the same tools as humans. Combining our newly developed AI software with LabDroid, we developed a variable scheduling system that continuously produces subcultures of cell lines without human intervention. The system periodically observes the cells on plates with a microscope, predicts the cell growth curve by processing cell images, and decides the best times for passage. We have succeeded in developing a system that maintains the cultures of two HEK293A cell plates with no human intervention for 192 h.
| S-EPMC7985857 | biostudies-literature
Project description:We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.
| S-EPMC3915531 | biostudies-other
Project description:In common variable immunodeficiency (CVID), heterozygous damaging NFKB1 variants represent the most frequent monogenic cause. NFKB1 encodes the precursor p105, which undergoes proteasomal processing to generate the mature NF-κB transcription factor subunit p50. The majority of NFKB1 sequence changes comprises missense variants of uncertain significance (VUS), each requiring functional evaluation to assess causality, particularly in families with multiple affected members presenting with different phenotypes. In four affected members of a German family, all diagnosed with CVID, we identified a previously uncharacterized heterozygous NFKB1 missense variant (c.1049A>G; p.Tyr350Cys). The clinical phenotypes varied markedly regarding onset, frequency and severity of infections. Consistent immunologic findings were hypogammaglobulinemia with normal specific antibody response to protein- and polysaccharide-based vaccinations, reduced switched memory B cells and decreased lymphocyte proliferation upon stimulation with the B cell mitogen SAC. To assess the pathogenicity of the NFKB1 missense variant, we employed immunophenotyping and functional analyses in a routine in vitro cell culture model. Following site-directed mutagenesis to introduce the variant into overexpression vectors encoding EGFP-fused p105 or p50, we analyzed transiently transfected HEK293T cells by confocal imaging and Western blotting. The cytoplasmic p105-Tyr350Cys precursor gained only weak expression levels indicating accelerated decay. The missense change disabled processing of the precursor to prevent the generation of mutant p50. Unlike the wildtype p50, the overexpressed mutant p50-Tyr350Cys was also not sustainable and showed a conspicuous subnuclear mislocalization with accumulation in dense aggregates instead of a homogenous distribution. Electrophoretic mobility shift assays, fluorescence-based reporter gene analyses and co-transfection experiments however demonstrated, that the DNA-binding activity of p50-Tyr350Cys and the interaction with RelA(p65), IκBα and wildtype p50 were preserved. Mutation carriers had reduced p105 and p50 levels, indicating insufficient protein amounts as the most likely primary defect. In conclusion, the missense variant c.1049A>G caused a detrimental defect, preventing the persistent expression of both, the p105-Tyr350Cys precursor and the mature p50-Tyr350Cys. The variable clinical phenotypes among affected family members sharing an identical pathogenic NFKB1 variant support a disease mechanism provoked by a p105/p50 (haplo)insufficient condition.
| S-EPMC8115018 | biostudies-literature
Project description:The idea of "date" and "party" hubs has been influential in the study of protein-protein interaction networks. Date hubs display low co-expression with their partners, whilst party hubs have high co-expression. It was proposed that party hubs are local coordinators whereas date hubs are global connectors. Here, we show that the reported importance of date hubs to network connectivity can in fact be attributed to a tiny subset of them. Crucially, these few, extremely central, hubs do not display particularly low expression correlation, undermining the idea of a link between this quantity and hub function. The date/party distinction was originally motivated by an approximately bimodal distribution of hub co-expression; we show that this feature is not always robust to methodological changes. Additionally, topological properties of hubs do not in general correlate with co-expression. However, we find significant correlations between interaction centrality and the functional similarity of the interacting proteins. We suggest that thinking in terms of a date/party dichotomy for hubs in protein interaction networks is not meaningful, and it might be more useful to conceive of roles for protein-protein interactions rather than for individual proteins.
| S-EPMC2887459 | biostudies-literature
Project description:Coordinating the charging scheduling of electric vehicles for dynamic dial-a-ride services is challenging considering charging queuing delays and stochastic customer demand. We propose a new two-stage solution approach to handle dynamic vehicle charging scheduling to minimize the costs of daily charging operations of the fleet. The approach comprises two components: daily vehicle charging scheduling and online vehicle-charger assignment. A new battery replenishment model is proposed to obtain the vehicle charging schedules by minimizing the costs of vehicle daily charging operations while satisfying vehicle driving needs to serve customers. In the second stage, an online vehicle-charger assignment model is developed to minimize the total vehicle idle time for charges by considering queuing delays at the level of chargers. An efficient Lagrangian relaxation algorithm is proposed to solve the large-scale vehicle-charger assignment problem with small optimality gaps. The approach is applied to a realistic dynamic dial-a-ride service case study in Luxembourg and compared with the nearest charging station charging policy and first-come-first-served minimum charging delay policy under different charging infrastructure scenarios. Our computational results show that the approach can achieve significant savings for the operator in terms of charging waiting times (-74.9%), charging times (-38.6%), and charged energy costs (-27.4%). A sensitivity analysis is conducted to evaluate the impact of the different model parameters, showing the scalability and robustness of the approach in a stochastic environment.
| S-EPMC8136635 | biostudies-literature
Project description:This data article presents a flow shop scheduling problem in which machines are not available during the whole planning horizon and the periods of unavailability are due to random faults. The experimental dataset consists of two problems with different sizes. In the largest one, about 2400 problems were analysed and compared with two diffuse metaheuristics: Genetic Algorithm (GA) and Harmony Search (HS). In the smallest, about 600 problems were analysed comparing the solution obtained with an exhaustive algorithm with those obtained by means of GA and HS. This dataset represents a test-bed for further works, allowing a comparison between the solution quality and the computation time obtained with different optimization methods. The substantial computational effort spent to generate the dataset undoubtedly represents a significant asset for the scientific community.
| S-EPMC8049987 | biostudies-literature
Project description:Efficient single-cell assignment without prior marker gene annotations is essential for single-cell sequencing data analysis. Current methods, however, have limited effectiveness for distinct single-cell assignment. They failed to achieve a well-generalized performance in different tasks because of the inherent heterogeneity of different single-cell sequencing datasets and different single-cell types. Furthermore, current methods are inefficient to identify novel cell types that are absent in the reference datasets. To this end, we present scLearn, a learning-based framework that automatically infers quantitative measurement/similarity and threshold that can be used for different single-cell assignment tasks, achieving a well-generalized assignment performance on different single-cell types. We evaluated scLearn on a comprehensive set of publicly available benchmark datasets. We proved that scLearn outperformed the comparable existing methods for single-cell assignment from various aspects, demonstrating state-of-the-art effectiveness with a reliable and generalized single-cell type identification and categorizing ability.
| S-EPMC7608777 | biostudies-literature