Results 11 to 20 of about 32,492 (256)
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks [PDF]
Computers & Industrial Engineering, 2013 In this paper, we investigate the problem of minimizing makespan in a multistage hybrid flow-shop scheduling with multiprocessor tasks. To generate high-quality approximate solutions to this challenging NP-hard problem, we propose a discrepancy search heuristic that is based on the new concept of adjacent discrepancies.
Lahimer, Asma +2 more
openaire +4 more sources
AI and OR in management of operations: history and trends [PDF]
, 2007 The last decade has seen a considerable growth in the use of Artificial Intelligence (AI) for operations management with the aim of finding solutions to problems that are increasing in complexity and scale.
Kobbacy, KAH, Rasmy, MH, Vadera, S
core +1 more source
A Novel Hybrid Algorithm for Permutation Flow Shop Scheduling
CoRR, 2014 In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customers constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning.
Sandeep Kumar, Pooja Jadon
openaire +2 more sources
A new adaptive neural network and heuristics hybrid approach for job-shop scheduling [PDF]
, 2001 Copyright @ 2001 Elsevier Science LtdA new adaptive neural network and heuristics hybrid approach for job-shop scheduling is presented. The neural network has the property of adapting its connection weights and biases of neural units while solving the ...
Baker +18 more
core +2 more sources
A scheduling theory framework for GPU tasks efficient execution [PDF]
, 2018 Concurrent execution of tasks in GPUs can reduce the computation time of a workload by overlapping data transfer and execution commands.
A Allahverdi +11 more
core +2 more sources
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective [PDF]
, 2019 In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have been proposed in the literature to
Fernández-Viagas Escudero, Víctor +2 more
core
On the use of biased-randomized algorithms for solving non-smooth optimization problems [PDF]
, 2020 Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Ferrer Biosca, Albert +4 more
core +3 more sources
A Hybrid Algorithm for the Permutation Flow Shop Scheduling Problem [PDF]
, 2013 This paper considers the application of IA for the classic permutation flow shop scheduling problem. We present a hybrid version of constructively built IA combining with the SA for the n-job, m-machine permutation flow shop scheduling problem to minimize makespan.
Arindam Chakravorty, Dipak Laha
openaire +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background Cognitive impairment is a common non‐motor symptom in Multiple Sclerosis (MS), negatively affecting autonomy and Quality of Life (QoL). Innovative rehabilitation strategies, such as semi‐immersive virtual reality (VR) and computerized cognitive training (CCT), may offer advantages over traditional cognitive rehabilitation (TCR ...
Maria Grazia Maggio +8 more
wiley +1 more source
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations [PDF]
, 2019 In this paper, we address the hybrid flowshop scheduling problem for makespan minimisation. More specifically, we are interested in the special case where there are missing operations, i.e.
Dios, Manuel +2 more
core