Results 11 to 20 of about 48,711 (267)
IEEE Access, 2019 This paper considers the problem of scheduling a set of jobs on unrelated parallel machines subject to several constraints which are non-zero arbitrary release dates, limited additional resources, and non-anticipatory sequence-dependent setup times.
Ibrahim M. Al-harkan, Ammar A. Qamhan
doaj +1 more source
On parallelism in turing machines [PDF]
17th Annual Symposium on Foundations of Computer Science (sfcs 1976), 1976 A model of parallel computation based on a generalization of nondeterminism in Turing machines is introduced. Complexity classes //T(n)-TIME, //L(n)-SPACE, //LOGSPACE, //PTIME, etc. are defined for these machines in a way analogous to T(n)-TIME, L(n)-SPACE, LOGSPACE, PTIME, etc. for deterministic machines.
openaire +1 more source
Coordinated Production and Delivery Operations With Parallel Machines and Multiple Vehicles
IEEE Access, 2020 This paper investigated a coordinated optimization problem of production and delivery operations with parallel machines and multiple vehicles so that a more cost-effective and sustainable supply chain performance can be achieved.
Dunhu Liu +3 more
doaj +1 more source
IEEE Access, 2017 This paper examines the uniform parallel-machine scheduling problem in which the objective aims to minimize the total resource consumption (TRC) with a bounded makespan. A matheuristic is proposed to deal with this strongly NP-hard problem.
Shih-Wei Lin, Kuo-Ching Ying
doaj +1 more source
IEEE Access, 2021 In this study, the objective of minimizing makespan has been considered for a scheduling problem of identical parallel machines with a single server and unavailability constraints.
Lotfi Hidri +3 more
doaj +1 more source
Abstract And-Parallel Machines.
Comput. Artif. Intell., 2000 Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are suggested. The first, the and-parallel Turing machine, can be viewed as a generalization of the deterministic Turing machine in which the infinite tape is replaced by an infinite tree-like tape on which processors work in parallel.
Lindenstrauss, Naomi, Dershowitz, Nachum
openaire +2 more sources
Journal of Mathematics, 2023 In this paper, we focus on solving the vector scheduling problem with submodular penalties on parallel machines. We are given n jobs and m parallel machines, where each job is associated with a d-dimensional vector.
Bihui Cheng, Wencheng Wang
doaj +1 more source
Design of Processor Array Based on an Optimized Multiprojection Approach
Advances in Electrical and Computer Engineering, 2012 Parallelization methodologies allow to automate the process of designing optimal processor arrays based on mathematical representations of the algorithm to be implemented.
CAMPOS, J.-M, CUMPLIDO, R.
doaj +1 more source
IDENTICAL PARALLEL MACHINES SCHEDULING USING GENETIC ALGORITHM
Iraqi Journal for Mechanical and Materials Engineering, 2018 Minimizing the scheduling production time consider one of the most important factors for companies which their objectives is achieve the maximum profits.
Aseel J Haleel
doaj +1 more source
Resource constraint scheduling on two dedicated machines: Application to avionics
EURO Journal on Computational OptimizationIn civil aircraft, two partially redundant hydraulic circuits typically power various systems. During assembly, a critical phase involves simultaneously rinsing and purging these hydraulic circuits using loops.
Ouissem Mesli-Kesraoui +6 more
doaj +1 more source