Results 71 to 80 of about 129,345 (335)
Improve Algoritma Hodgson Untuk Meminimasi Jumlah Job Terlambat Pada Penjadwalan Flow shop
Since Johnson published a paper in 1954, the problem of job scheduling has received the attention of hundreds of practitioners and researchers, as one of the most studied topics in Operation research.
Dian Setiya Widodo
doaj +1 more source
We quantified and cultured circulating tumor cells (CTCs) of 62 patients with various cancer types and generated CTC‐derived tumoroid models from two salivary gland cancer patients. Cellular liquid biopsy‐derived information enabled molecular genetic assessment of systemic disease heterogeneity and functional testing for therapy selection in both ...
Nataša Stojanović Gužvić+31 more
wiley +1 more source
Research on Limited Buffer Scheduling Problems in Flexible Flow Shops with Setup Times [PDF]
In order to solve the limited buffer scheduling problems in flexible flow shops with setup times, this paper proposes an improved whale optimization algorithm (IWOA) as a global optimization algorithm. Firstly, this paper presents a mathematic programming model for limited buffer in flexible flow shops with setup times, and applies the IWOA algorithm ...
arxiv
A hybrid Lagrangean metaheuristic for the two-machine cross-docking flow shop scheduling problem [PDF]
Cross-docking is a logistics strategy that minimizes the storage and picking functions of conventional warehouses. The objective is to unload the cargo from inbound trucks and directly load it into outbound trucks, with little or no storage. The success of the strategy depends on an efficient transshipment operation.
arxiv +1 more source
The authors analyzed the spatial distributions of gene and metabolite profiles in cervical cancer through spatial transcriptomic and spatially resolved metabolomic techniques. Pivotal genes and metabolites within these cases were then identified and validated.
Lixiu Xu+3 more
wiley +1 more source
A Note on Heuristics of Flow-Shop Scheduling [PDF]
We present an O(mn) two-group (TG) heuristic for the m-machine, n-job permutation flow-shop scheduling problem. We show that heuristic TG has a worst-case performance ratio of (m + 1)/2. We also establish worst-case bounds for several heuristics proposed in the past.
openaire +2 more sources
This study simultaneously investigated circulating tumor cells (CTCs) and exosomes from small‐cell lung cancer (SCLC) patients. The elevated expression of JUNB and CXCR4 in CTCs was a poor prognostic factor for SCLC patients, whereas exosomal overexpression of these biomarkers revealed a high discrimination ability of patients from healthy individuals,
Dimitrios Papakonstantinou+13 more
wiley +1 more source
Improvements for multi-objective flow shop scheduling by Pareto Iterated Local Search [PDF]
The article describes the proposition and application of a local search metaheuristic for multi-objective optimization problems. It is based on two main principles of heuristic search, intensification through variable neighborhoods, and diversification through perturbations and successive iterations in favorable regions of the search space. The concept
arxiv
High‐grade serous ovarian cancer (HGSOC) is the most common and aggressive type of ovarian cancer with urgent need for new treatment strategies. This study evaluates plasma‐activated media (PAM) as a novel treatment for HGSOC, showing its ability to selectively induce oxidative stress and apoptosis in HGSOC cell lines, patient ascites cells and primary
Lorena T. Davies+9 more
wiley +1 more source
Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks [PDF]
This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The problem even in its simplest form is NP-hard in the strong sense. The great deal of interest for this problem, besides its theoretical complexity, is animated by needs of various manufacturing and computing systems.
arxiv