Pengyu Yan

TL;DR: A single-machine scheduling problem with power-down mechanism to minimize both total energy consumption and maximum tardiness and a basic e − constraint method is proposed to obtain the complete Pareto front of the problem.

TL;DR: A branch and bound algorithm is described for optimal cyclic scheduling in a robotic cell with processing time windows that could find an optimal solution by enumerating partial non-prohibited intervals by dividing these prohibited intervals into a series of subsets.

TL;DR: This paper presents the first mixed integer programming (MIP) model for the multi-cyclic robotic flowshop scheduling problem based on the description and analysis of the problem and solves the model using commercial software CPLEX.

TL;DR: In this paper, an exact algorithm to solve a cyclic hoist scheduling problem in a printed circuit board (PCB) electroplating facility, where multi-type parts with fixed processing times are processed in the same time and the parts are not allowed to wait in the tanks or on the hoist, is proposed.

TL;DR: This paper investigates a real-time dynamic job-shop scheduling problem in a robotic cell, in which multiple jobs enter into the cell with unexpected arriving rates, and proposes an exact iterative algorithm, which starts with a relaxed solution of the MIP model and iteratively adds essential robot handling capacity constraints back to the relaxed Mip model until an optimal solution is found.