Results 1 to 10 of about 2,690 (168)
A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs [PDF]
Journal of Project Management, 2022 Job precedence can often be seen in various manufacturing process scenarios. For instance, in the context of flow shop scheduling, certain jobs must be processed before a specific job may be executed.
M. Thangaraj +2 more
doaj +1 more source
Estimation of mining time-span to improve the solution time in long-term production planning [PDF]
International Journal of Mining and Geo-Engineering, 2022 Long-term production planning in open-pit mines is a precedence-constraint knapsack problem. A spatial representation of the mining region (called the block-model) is the primary input of mine planning models. One should note that as the number of blocks
Mehdi Rahmanpour +2 more
doaj +1 more source
Makespan minimization with OR-precedence constraints [PDF]
Journal of Scheduling, 2021 AbstractWe consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its predecessors to be completed before it can start.
openaire +3 more sources
Scheduling with AND/OR Precedence Constraints [PDF]
SIAM Journal on Computing, 2004 In many scheduling applications it is required that the processing of some job must be postponed until some other job, which can be chosen from a pre-given set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions.
Moehring, R., Skutella, M., Stork, F.
openaire +3 more sources
Scheduling the Work of Multiple Construction Crews Working Concurrently in Repetitive Construction Projects [PDF]
Journal of Engineering Science and Military Technologies, 2023 In repetitive construction projects such as roads, pipelines and multi-story buildings, schedulers might need to utilize multiple crews to simultaneously construct sub-activities of a particular activity to shorten their duration.
Yasser khalifa +3 more
doaj +1 more source
Service Flow Management with deadline and budget Constraints using Genetic Algorithm in Heterogeneous Computing [PDF]
IJCI International Journal of Computers and Information, 2019 The service flow management is one from the most challenges especially in heterogeneous environments which has several and various processors for computing. Service flow is used to explain services configuration process when service’s formation according
Ahmed AbdelHamed +2 more
doaj +1 more source
Algorithms, 2023 The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was ...
Mauro Dell’Amico +2 more
doaj +1 more source
Energies, 2021 The use of parallel applications in High-Performance Computing (HPC) demands high computing times and energy resources. Inadequate scheduling produces longer computing times which, in turn, increases energy consumption and monetary cost.
Alejandro Santiago +7 more
doaj +1 more source
The AllDifferent Constraint with Precedences [PDF]
, 2011 We propose AllDiffPrecedence, a new global constraint that combines together an AllDifferent constraint with precedence constraints that strictly order given pairs of variables. We identify a number of applications for this global constraint including instruction scheduling and symmetry breaking. We give an efficient propagation algorithm that enforces
Narodytska, Nina +3 more
openaire +3 more sources
Scheduling malleable tasks with precedence constraints [PDF]
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jansen, Klaus, Zhang, Hu
openaire +3 more sources