Minimizing the number of tardy jobs with precedence constraints and agreeable due dates [PDF]
Minimizing the number of precedence constrained, unit-time tardy jobs is strongly NP-hard on a single machine. We study a special case of the problem where a job is tardy if it is finished more than a fixed K time units after its earliest possible ...
Steiner, George
core +1 more source
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
Heuristics for the Early/Tardy Scheduling Problem with Release Dates [PDF]
In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search ...
Rui A. F. S. Alves, Jorge M. S. Valente
core
Scheduling Agreeable Jobs On A Single Machine To Minimize Weighted Number Of Early And Tardy Jobs
The problem of non-preemptive (NP) scheduling of number of jobs on a single machine to minimize weighted number of early and tardy jobs where the earliest start times and latest due date are agreeable (i.e.
Abass, O, O Abass, Adamu, MO, MO Adamu
core +1 more source
Importin 7 mediates the nuclear import of HIV‐1 integrase via a specific interacting interface
HIV‐1 integrase enables viral DNA integration into the host genome. By binding to the core domain of the host protein Importin 7 via its C‐terminal domain, the integrase is transported across the nuclear membrane into the nucleus, where integration of the viral genome into host DNA takes place. This translocation is a critical step for subsequent viral
Juana Bana +5 more
wiley +1 more source
In this paper, a novel O(N2) algorithm is presented to minimize the weighted number of tardy jobs with unit processing times, integer ready times and deadlines, and M homogeneous parallel machines, where N is the number of jobs to be scheduled.
Jon Peha (3891862)
core +1 more source
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines [PDF]
In this work, we study the computational (parameterized) complexity of P∣ r_j, p_j = p ∣∑ w_j U_j. Here, we are given m identical parallel machines and n jobs with equal processing time, each characterized by a release date, a due date, and a weight. The
Heeger, Klaus, Molter, Hendrik
core +3 more sources
Artificial Immune System for Single Machine Scheduling and Batching Problem in Supply Chain
This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing.
Morteza Rasti-Barzoki +2 more
doaj
Adenosine triphosphate as a modulator of protein interactions and stability
ATP is best known as the cell's energy currency, but it also shapes how proteins fold, interact, aggregate and form biomolecular condensates. This review explains the emerging physical principles behind these effects, including weak binding to charged protein regions, magnesium‐dependent behaviour and concentration‐dependent control of protein ...
Shuyuan Tan, Robin Curtis
wiley +1 more source
Using a Hybrid Genetic Algorithm to Minimize the Number of Tardy Jobs in the Flow Shop
Numerous real-world problems relating to flow shops scheduling are complex. The main problem is that the solution space is very large and therefore the set of feasible solutions cannot be enumerated one by one.
Jing Jing Wu
core +1 more source

