Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...
Lean buffering is the smallest buffer capacity, which is necessary and sufficient to ensure the desired production rate of a manufacturing system. Literature offers methods for des...
Applications such as layered manufacturing, or in general, solid free-form fabrication, pose a major challenge on online process control. For these parts to be functional, it is i...
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...