Solving Biobjective Distributed Flow-Shop Scheduling Problems With Lot-Streaming Using an Improved Jaya Algorithm.

A distributed flow-shop scheduling problem with lot-streaming that considers completion time and total energy consumption is addressed. It requires to optimally assign jobs to multiple distributed factories and, at the same time, sequence them. A biobjective mathematic model is first developed to describe the considered problem.

Multiobjective Flexible Job-Shop Rescheduling With New Job Insertion and Machine Preventive Maintenance.

In the actual production, the insertion of new job and machine preventive maintenance (PM) are very common phenomena. Under these situations, a flexible job-shop rescheduling problem (FJRP) with both new job insertion and machine PM is investigated. First, an imperfect PM (IPM) model is established to determine the optimal maintenance plan for each machine, and the optimality is proven.

Personalized Route Planning System Based on Driver Preference.

At present, most popular route navigation systems only use a few sensed or measured attributes to recommend a route. Yet the optimal route considered by drivers needs be based on multiple objectives and multiple attributes. As a result, these existing systems based on a single or few attributes may fail to meet such drivers' needs.

Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm.

Rescheduling is a necessary procedure for a flexible job shop when newly arrived priority jobs must be inserted into an existing schedule. Instability measures the amount of change made to the existing schedule and is an important metrics to evaluate the quality of rescheduling solutions. This paper focuses on a flexible job-shop rescheduling problem (FJRP) for new job insertion.