Results 21 to 30 of about 7,608,228 (197)
Approximation results for flow shop scheduling problems with machine availability constraints [PDF]
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing ...
Strusevich, Vitaly A. +2 more
core +1 more source
The paper concerns complexity studies on the scheduling problem arising in a simple flexible manufacturing system. The system consists of a single machine, one depot (both with unlimited buffers), and one vehicle (automated guided vehicle).
M. Espinouse +2 more
semanticscholar +2 more sources
Tactical fixed job scheduling with spread-time constraints [PDF]
We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs.
Zhang, Xiandong +3 more
core +1 more source
We consider two single-machine scheduling problems with the late work criterion, where each job’s processing time follows a decreasing convex function of the resource consumption amount, and each job can be interrupted and resumed later.
Byung-Cheon Choi, Myoung-Ju Park
semanticscholar +1 more source
Job-shop scheduling with an adaptive neural network and local search hybrid approach [PDF]
This article is posted here with permission from IEEE - Copyright @ 2006 IEEEJob-shop scheduling is one of the most difficult production scheduling problems in industry.
Yang, S +3 more
core +1 more source
Dense tactile streams from across the humanoid body converge on collide in a central wiring and data bottleneck. By relocating computation closer to and then into the skin itself, near‐ and in‐sensor architectures, together with neuromorphic computing, chart a path toward perception‐native electronic skin, in which the conversion of stimulus into ...
Mijin Kim +6 more
wiley +1 more source
Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times [PDF]
The official published version of the article can be found at the link below.A two-machine flowshop scheduling problem is addressed to minimize setups and makespan where each job is characterized by a pair of attributes that entail setups on each machine.
Hendizadeh, SH, Mansouri, SA, Salmasi, N
core +1 more source
Multimodal Human–Robot Interaction Using Human Pose Estimation and Local Large Language Models
A multimodal human–robot interaction framework integrates human pose estimation (HPE) and a large language model (LLM) for gesture‐ and voice‐based robot control. Speech‐to‐text (STT) enables voice command interpretation, while a safety‐aware arbitration mechanism prioritizes gesture input for rapid intervention.
Nasiru Aboki +2 more
wiley +1 more source
In this study, we identify a novel functional role of ZBTB18 in regulating trigeminal‐mediated neuropathic pain. Nerve injury reduces ZBTB18 in trigeminal ganglion neurons, impairing CHD4/NuRD recruitment and de‐repressing Clic1. Elevated CLIC1 enhances chloride channel activity and neuronal hyperexcitability, thereby driving pain.
Shoupeng Wang +11 more
wiley +1 more source
Exploiting Edge Semantics in Job Shop Scheduling Problem With Heterogeneous Graph Transformers
A heterogeneous graph transformer (HGT) is introduced for reinforcement learning‐based job shop scheduling by explicitly distinguishing precedence and machine‐contention relations through edge‐type‐specific attention. The proposed framework learns richer scheduling representations, improves decision quality over homogeneous graph models, and highlights
Bulent Soykan, Fatih Kasimoglu
wiley +1 more source

