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:Although a wide range of literature has investigated the network-level highway maintenance plans and policies, few of them focused on the maintenance scheduling problem. This study proposes a methodology framework to model and compare two different maintenance scheduling strategies for highway networks, i.e., minimal makespan strategy (MMS) and minimal increased travel delay strategy (MITDS). We formulate MMS as a mixed integer linear programming model subject to the constraints of the quantity of manpower and the worst-first maintenance sequence. A bi-level programming model is proposed to quantify and optimize MITDS. The upper level model determines the optimal scheduling to minimize the increased traffic delays during the maintenance makespan. In the lower level, a modified day-to-day traffic assignment model is put forward to reflect the traffic evolution dynamics by simulating travelers' route choice behaviors. A simulated annealing algorithm and augmented Lagrange algorithm are employed to solve the two proposed models, respectively. Finally, a numerical example using a highway network is developed. The two proposed strategies are tested considering different traffic demands, numbers of engineering teams, and travelers' sensitivities to traffic congestion. The experiment results reveal that compared with MMS, MITDS extends makespan by 2 days though, it reduces the total increased travel delays by 4% and both MMS and MITDS can obtain the minimum total increased travel delays when the number of engineering teams is 6. The sensitivity analysis indicates that both the two strategies have the maximum and minimum total increased travel delays when the weight of prediction in travelers' perception is 0.3 and 0.7, respectively. The proposed framework has the potential to provide reference in implementing highway maintenance activities reasonably.
| S-EPMC9176791 | 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:We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.
| S-EPMC8929393 | biostudies-literature
Project description:A multi-objective modeling approach is required in the context of generator maintenance scheduling (GMS) for power generation systems. Most multi-objective modeling approaches in practice are modeled using a periodic system approach that caters for a fixed maintenance window. This approach is not suitable for different types of generating units and cannot extend the generator lifespan. To address this issue, this study proposes a tri-objective GMS model with three conflicting objectives based on the sequential system approach that accounts for operating hours and start-up times. The GMS model's objectives are to minimize the total operation cost, maximize system reliability and minimize violation. The main difference between the proposed tri-objective GMS model and other multi-objective GMS models, is that the proposed model uses a sequential strategy based on operating hours and start-up times. In addition, the proposed model has considered the most important criteria in scheduling the generator maintenance, and this reflects the real-life requirements in electrical power systems. A multi-objective graph model is also developed to generate the maintenance units scheduling and used in developing the proposed Pareto ant colony system (PACS) algorithm. A PACS algorithm is proposed to implement the model and obtain solution for GMS. The performance of the proposed model was evaluated using the IEEE RTS 26, 32, and 36-unit systems dataset. The performance metrics used comprise the GMS model objectives. The experimental results showed that the obtained solution from the proposed tri-objective GMS model was a robust solution by considering the different initial operational hours of the units.
| S-EPMC9578641 | biostudies-literature
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