Results 41 to 50 of about 11,921 (298)

Special Issue on Algorithms for Scheduling Problems

open access: yesAlgorithms, 2018
This special issue of Algorithms is devoted to the development of scheduling algorithms based on innovative approaches for solving hard scheduling problems either exactly or approximately. Submissions were welcome both for traditional scheduling problems
Frank Werner   +2 more
doaj   +1 more source

OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS

open access: yesUral Mathematical Journal, 2018
We study the optimization of the initial state, route (a permutation of indices), and track in an extremal problem connected with visiting a finite system of megalopolises subject to precedence constraints where the travel cost functions may depend on ...
Alexander G. Chentsov   +2 more
doaj   +1 more source

A Genetic Crow Search Algorithm for Optimization of Operation Sequencing in Process Planning

open access: yesApplied Sciences, 2021
Computer-aided process planning represents the main link between computer-aided design and computer-aided manufacturing. One of the crucial tasks in computer-aided process planning is an operation sequencing problem.
Mica Djurdjev   +5 more
doaj   +1 more source

Process planning optimization on turning machine tool using a hybrid genetic algorithm with local search approach

open access: yesAdvances in Mechanical Engineering, 2015
A turning machine tool is a kind of new type of machine tool that is equipped with more than one spindle and turret. The distinctive simultaneous and parallel processing abilities of turning machine tool increase the complexity of process planning.
Yuliang Su   +3 more
doaj   +1 more source

D2D Computation Offloading Optimization for Precedence-Constrained Tasks in Information-Centric IoT

open access: yesIEEE Access, 2019
This paper proposes a computation offloading scheme for precedence-constrained tasks in a base station-assisted device-to-device (D2D) scenario for the information-centric Internet of Things (IC-IoT).
Jindou Xie   +4 more
doaj   +1 more source

Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem

open access: yesModelling and Simulation in Engineering, 2016
This paper proposes a number of forward VNS and reverse VNS algorithms for job-shop scheduling problem. The forward VNS algorithms are the variable neighborhood search algorithms applied to the original problem (i.e., the problem instance with the ...
Pisut Pongchairerks
doaj   +1 more source

A simpler QPTAS for scheduling jobs with precedence constraints

open access: yesCoRR, 2022
Published in ESA 2022 (Track S)
Das, Syamantak, Wiese, Andreas
openaire   +4 more sources

Time Toxicity in Wilms Tumor: Quantifying the Burden of Healthcare Interaction in the First Year After Diagnosis

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Wilms tumor (WT) treatment imposes a significant time burden on patients and their families. Time toxicity is a patient‐centered metric that quantifies the burden of healthcare interaction. We sought to define time toxicity in the first year after diagnosis of WT and hypothesized that it would increase as tumor stage and treatment ...
Caleb Q. Ashbrook   +6 more
wiley   +1 more source

Therapeutic Apheresis in Nigeria: A Multi‐Center Summary of Abstracts From the Inaugural Nigerian Society for Apheresis Scientific Meeting

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye   +33 more
wiley   +1 more source

Sequencing with general precedence constraints

open access: yesDiscrete Applied Mathematics, 1981
Abstract Consider a set of jobs where an arbitrary precedence relationship exists among the jobs and a cost is associated with every permutation of the jobs. The objective is to find a minimum-cost permutation which is consistent with the precedence relations.
openaire   +2 more sources

Home - About - Disclaimer - Privacy