Results 21 to 30 of about 6,771,333 (197)
Fifty years of scheduling: a survey of milestones [PDF]
, 2009 Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A. +5 more
core +1 more source
Preemptive scheduling with simple linear deterioration on a single machine
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. T. Ng 0001 +3 more
openaire +2 more sources
Approximation results for flow shop scheduling problems with machine availability constraints [PDF]
, 2009 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
KPI Science News, 2019 Background. The problem of minimization of total weighted tardiness can be solved either exactly by the corresponding models or heuristically. As of October 2019, nearly the best heuristic is one based on using remaining available and processing periods.
Vadim V. Romanuke
doaj +1 more source
An efficient model for the preemptive single machine scheduling of equal-length jobs
CoRR, 2020 We propose a Boolean Linear Programming model for the preemptive single machine scheduling problem with equal processing times, arbitrary release dates and weights(priorities) minimizing the total weighted completion time. Almost always an optimal solution of the Linear Programming relaxation is integral and can be straightforwardly converted into an ...
Artem Fomin, Boris Goldengorin
openaire +3 more sources
KPI Science News, 2019 Background. A special case of the job scheduling process is that when jobs are processed on a single machine, preemptions are allowed, and there are no idle time intervals.
Vadim V. Romanuke
doaj +1 more source
Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine [PDF]
, 2016 We consider in this work a classical online scheduling problem with release times on a single machine. The quality of service of a job is measured by its stretch, which is defined as the ratio of its response time over its processing time. Our objective is to schedule the jobs non-preemptively in order to optimize the maximum stretch.
Dutot, Pierre-Francois +3 more
openaire +2 more sources
Split-merge:using exponential neighborhood search for scheduling a batching machine [PDF]
, 2015 We address the problem of scheduling a single batching machine to minimize the maximum lateness with a constraint restricting the batch size. A solution for this NP-hard problem is defined by a selection of jobs for each batch and an ordering of those ...
Song, Xiang +3 more
core +1 more source
Advanced Materials Technologies, EarlyView.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
Multimodal Human–Robot Interaction Using Human Pose Estimation and Local Large Language Models
Advanced Robotics Research, EarlyView.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