Results 31 to 40 of about 22,096 (146)
Survival and disinfection of SARS-Cov-2 in environment and contaminated surface [PDF]
, 2020 The detection of SARS-Cov-2 in the sewage and water resources has increased the awareness among the people about the possibility survival of SARS-Cov-2 in the environment and the potential to transmit into the human through food chain or water resources.
Al-Gheethi, Adel +5 more
core
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem [PDF]
, 2014 As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the ...
Fernández-Viagas Escudero, Víctor +1 more
core +1 more source
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
A fast, effective local search for scheduling independent jobs in heterogeneous computing environments [PDF]
, 2003 The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing.
Levine, J., Ritchie, G.
core
A simheuristic algorithm for solving an integrated resource allocation and scheduling problem [PDF]
, 2019 Modern companies have to face challenging configuration issues in their manufacturing chains. One of these challenges is related to the integrated allocation and scheduling of resources such as machines, workers, energy, etc.
Ferone, Daniele +4 more
core +1 more source
International Transactions in Operational Research, Volume 33, Issue 3, Page 1525-1558, May 2026.Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge +3 more
wiley +1 more source
Spatial-temporal data modelling and processing for personalised decision support [PDF]
, 2015 The purpose of this research is to undertake the modelling of dynamic data without losing any of the temporal relationships, and to be able to predict likelihood of outcome as far in advance of actual occurrence as possible.
Othman, Muhaini
core
A reclaimer scheduling problem arising in coal stockyard management
, 2015 We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial ...
Angelelli, Enrico +3 more
core +1 more source
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimize total flowtime [PDF]
, 2016 This paper focuses on the blocking flow shop scheduling problem with the objective of total flowtime minimisation. This problem assumes that there are no buffers between machines and, due to its application to many manufacturing sectors, it is receiving ...
Fernández-Viagas Escudero, Víctor +2 more
core +1 more source
Minimum Makespan Multi-Vehicle Dial-a-Ride [PDF]
ACM Transactions on Algorithms, 2009 Dial-a-Ride problems consist of a setVofnvertices in a metric space (denoting travel time between vertices) and a set ofmobjects represented as source-destination pairs {(si,ti)}mi=1, where each object requires to be moved from its source to destination vertex.
Gørtz, Inge Li +2 more
openaire +3 more sources