• Publications
  • Influence
Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints
TLDR
A list-scheduling-based multiobjective parthenogenetic algorithm (LS-MPGA) developed for trade-off is superior to the other three algorithms and discusses their application environments.
Dynamic Constraint Satisfaction Approach to Hybrid Flowshop Rescheduling
TLDR
A heuristic algorithm inspired by the idea of repair-based DCSP solving techniques is proposed that can identify and eliminate the resource conflicts between related operations brought by the disruptions, and generate new schedule respecting the objective functions.
Scheduling Two-machine Flowshop with Limited Waiting Times to Minimize Makespan
TLDR
A two-stage search algorithm is proposed, in which the initial schedule is generated by a modified LK heuristic in the first stage and the excellent solution can be obtained by constructing inserting neighborhood in the second stage.
Gene Shift Operators of Partheno-Genetic Algorithm for Permutation Flowshop Scheduling with Limited Waiting Times
TLDR
A basic Partheno-Genetic Algorithm (PGA) is presented, and constructions of two kinds of gene shift operators in PGA are focused on, including single-point shift operator and multi- point shift operator.
Design of a Monitoring and Rescheduling System for Steelmaking-Continuous Casting Production
TLDR
Based on the characteristics of monitored disturbances, two rescheduling methods named time adjustment and machine reassignment are presented, designed for disturbances with weak influence by utilizing reserved times and flexible factors in the SCC production.
Gene Exchange Operators of Partheno-Genetic Algorithm for Permutation Flowshop Scheduling with Maximum and Minimum Time Lag Constraints
Permutation flowshop scheduling problem with maximum and minimum time lag constraints to minimize the makespan is considered, and a framework of partheno-genetic algorithm for the problem is
Job Rejection Strategies in Genetic Algorithm for Permutation Flowshop Scheduling Problem with Rejection
TLDR
Improved parallel strategy is presented by employing theserial strategy to optimize the solution obtained by the parallel strategy, and has the close solution quality as the serial strategy but with much shorter computational time.