Results 31 to 40 of about 3,527 (306)
A hybrid approach for haptics-based intelligent assembly planning
Assembly planning is normally realized by automatic approach or interactive approach. Both of these methods have promising advantages, but they also have inevitable shortcomings.
Pingjun Xia
doaj +1 more source
This paper presents a novel linear mathematical model for integrated cell formation and task scheduling in the cellular manufacturing system (CMS). It is suitable for the dual-resource constrained setting, such as garment process, component assembly, and
Jufeng Wang, Chunfeng Liu, Kai Li
doaj +1 more source
Approximate Deadline-Scheduling with Precedence Constraints [PDF]
We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasible schedule needs to be consistent with chain-like precedence constraints. The goal is to compute a feasible schedule that minimizes the sum of penalties of late jobs. Lenstra
Efsandiari, Hossein +5 more
openaire +2 more sources
The vehicle routing problem is the basic problem of distribution planning which seeks to find the best route with minimum displacement cost considering the number of customers, their constraints, and number and capacity of the available vehicles. In this
Davoud Sedighizadeh, Houman Mazaheripour
doaj +1 more source
Robots are now widely used in product disassembly lines, which significantly improves end-of-life (EOL) product disassembly efficiency. Most of the current research on disassembly line balancing problems focuses on decomposing one product.
Gongdan Xu +5 more
doaj +1 more source
Handling linear precedence constraints by unification [PDF]
Linear precedence (LP) rules are widley used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. Since they only order siblings, they are not quite adequate, at least not for German.
Judith Engelkamp +2 more
openaire +1 more source
: "Inspired by the popularity of anytime algorithms in solving complex real world problems, we define a class of scheduling problems. In addition to the normal resource constrained project scheduling assumptions, each activity in a project has a quality ...
Xiaofang Wang (5399006)
core +1 more source
An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints [PDF]
We consider a scheduling problem on unrelated machines with precedence constraints. There are m unrelated machines and n jobs and every job has to be processed non-preemptively in some machine.
Nguyen, Kim Thang, Thắng, Nguyễn Kim
core +1 more source
A Precedence Constraint Posting Approach for the RCPSP with Time Lags and Variable Durations
. Resource Constrained Project Scheduling Problem is a very important problem in project management, manufacturing and resource optimization. We focus on a variant of RCPSP with time lags and vari-able activity durations. The solving approach is based on
MILANO, MICHELA +3 more
core +1 more source
Nonparametric inference for residual-life functionals is a fundamental problem in mathematical statistics, reliability theory, and survival analysis, particularly in studies with limited sample sizes where empirical plug-in estimators may exhibit ...
Abdulmajeed A. R. Alharbi
doaj +1 more source

