Results 71 to 80 of about 28,243 (317)

Possible role of human ribonuclease dicer in the regulation of R loops

open access: yesFEBS Open Bio, EarlyView.
R loops play an important role in regulating key cellular processes such as replication, transcription, centromere stabilization, or control of telomere length. However, the unscheduled accumulation of R loops can cause many diseases, including cancer, and neurodegenerative or inflammatory disorders. Interestingly, accumulating data indicate a possible
Klaudia Wojcik   +2 more
wiley   +1 more source

Performance analysis of control allocation using data‐driven integral quadratic constraints

open access: yesAdvanced Control for Applications, Volume 4, Issue 4, December 2022., 2022
Abstract A new method is presented for evaluating the performance of a nonlinear control allocation system within a linear control loop. To that end, a worst‐case gain analysis problem is formulated that can be readily solved by means of well‐established methods from robustness analysis using integral quadratic constraints (IQCs).
Manuel Pusch   +2 more
wiley   +1 more source

A MILP model for an extended version of the Flexible Job Shop Problem [PDF]

open access: yes, 2014
A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order. The goal is the minimization of the makespan.
arxiv   +1 more source

PEMAKAIAN ALGORITMA GENETIK UNTUK PENJADWALAN JOB SHOP DINAMIS NON DETERMINISTIK

open access: yesJurnal Teknik Industri, 2004
Dynamic Job shops non deterministic scheduling problem is concerned with ordering some operations that processed by certain machines with variable and unknown arrival time of jobs. When new jobs arrive, it requires modifications in the existing schedule.
Nico Saputro, Yento Yento
doaj  

PENGEMBANGAN ALGORITMA PENJADUALAN PRODUKSI JOB SHOP UNTUK MEMINIMUMKAN TOTAL BIAYA EARLINESS DAN TARDINESS

open access: yesJurnal Ilmiah Teknik Industri, 2005
This paper develops job shop production scheduling using Non Delay algorithm through forward and backward-forward algorithm to minimize total earliness and tardiness costs.
Dian Retno Sari Dewi
doaj   +1 more source

A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems [PDF]

open access: yesarXiv, 2012
Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging Optimization for solving Job Shop Scheduling Problem was ...
arxiv  

A hybrid algorithm for flexible job-shop scheduling problem with setup times

open access: yesInternational Journal of Production Management and Engineering, 2017
Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines.
Ameni Azzouz   +2 more
doaj   +1 more source

An effective hybrid algorithm for multi-objective flexible job-shop scheduling problem

open access: yesAdvances in Mechanical Engineering, 2018
Genetic algorithm is one of primary algorithms extensively used to address the multi-objective flexible job-shop scheduling problem. However, genetic algorithm converges at a relatively slow speed.
Xiabao Huang, Zailin Guan, Lixi Yang
doaj   +1 more source

A Dynamic Adjusted Aggregate Load Method to Support Workload Control Policies

open access: yesApplied Sciences, 2020
Workload control mechanisms are widely studied in the literature for the control of job-shop systems. The control of these systems involves acceptance, order release and priority dispatching.
Paolo Renna
doaj   +1 more source

Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms [PDF]

open access: yesarXiv, 2013
We consider several combinatorial optimization problems which combine the classic shop scheduling problems, namely open shop scheduling or job shop scheduling, and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that forms a feasible solution of the shortest path problem, and to execute the selected jobs ...
arxiv  

Home - About - Disclaimer - Privacy