Results 81 to 90 of about 122,671 (350)

Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

open access: yesJournal of Applied Mathematics, 2012
Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in ...
Behnam Barzegar   +2 more
doaj   +1 more source

Seeking Simulation-based Optimization of Job shop Scheduling in Small and Medium Enterprises to Minimize the Cost of Tardiness and Earliness of Activities [PDF]

open access: yesمدیریت صنعتی, 2017
Determining the optimal sequence of jobs in job shop scheduling for small and medium enterprises, affect the machine productivity, earliness and tardiness costs of delivery. The deterministic variant of the problem is well-known to be NP-Hard.
Seyed Mojtaba Sajadi, Sadegh Shahbazi
doaj   +1 more source

Translating a Preclinically Tested 15 Hz rTMS Protocol to Humans With Chronic Spinal Cord Injury: A Safety and Feasibility Study

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objectives Repetitive transcranial magnetic stimulation (rTMS) is a non‐invasive brain stimulation strategy with a demonstrated potential to reinforce the residual pathways after a spinal cord injury (SCI). A preclinically tested high‐frequency (15 Hz) rTMS (15 Hz rTMS) protocol was shown to induce corticospinal tract axon regeneration growth ...
Nabila Brihmat   +8 more
wiley   +1 more source

PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA

open access: yesJurnal Masyarakat Informatika, 2010
Job Shop Scheduling Problem (JSP) is a problem of work scheduling that can be describe by one or several job that have to be done by one or several source, each job contain of several operation that has to be done without interuption in several time and ...
Satriyo Adhy, Kushartantya Kushartantya
doaj   +1 more source

Scheduling of non-repetitive lean manufacturing systems under uncertainty using intelligent agent simulation [PDF]

open access: yes, 2008
World-class manufacturing paradigms emerge from specific types of manufacturing systems with which they remain associated until they are obsolete. Since its introduction the lean paradigm is almost exclusively implemented in repetitive manufacturing ...
Mousavi, A, Papadopoulou, T C
core   +1 more source

Job-shop scheduling with limited capacity buffers [PDF]

open access: yes, 2006
In this paper we investigate job-shop problems where limited capacity buffers to store jobs in non-processing periods are present. In such a problem setting, after finishing processing on a machine, a job either directly has to be processed on the ...
Brucker, Peter   +3 more
core   +3 more sources

Bilateral versus Unilateral Training With Rhythmic Auditory Cueing in Stroke Rehabilitation: Effects on Upper Limb Function and Interhemispheric Inhibition

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Stroke is a leading cause of long‐term disability in adults, with upper limb hemiparesis being a common impairment. Traditional training is mostly aimed at paralyzed limbs, but the effect of bilateral training is still unclear.
Fangfang Qian   +7 more
wiley   +1 more source

ICU‐EEG Pattern Detection by a Convolutional Neural Network

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients in the intensive care unit (ICU) often require continuous EEG (cEEG) monitoring due to the high risk of seizures and rhythmic and periodic patterns (RPPs). However, interpreting cEEG in real time is resource‐intensive and heavily relies on specialized expertise, which is not always available.
Giulio Degano   +5 more
wiley   +1 more source

A hybrid job-shop scheduling system [PDF]

open access: yes
The intention of the scheduling system developed at the Fraunhofer-Institute for Material Flow and Logistics is the support of a scheduler working in a job-shop.
Bayat-Sarmadi, Fahid   +3 more
core   +1 more source

An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order [PDF]

open access: yes, 2014
The paper considers a three-machine shop scheduling problem to minimize the makespan, in which the route of a job should be feasible with respect to a machine precedence digraph with three nodes and one arc.
Quibell, Richard, Strusevich, Vitaly A.
core   +1 more source

Home - About - Disclaimer - Privacy