This paper considers a flexible flow shop scheduling problem, where at least one production stage is made up of unrelated parallel machines. Moreover, sequenceand machinedependent setup times are given. The objective is to find a schedule that minimizes a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop environment. For this problem, a 0-1 m...

A common situation arising in flow shops is that the job processing order must be same on each machine; this referred to as a permutation shop scheduling problem (PFSSP). Although many algorithms have been designed solve PFSSPs, machine availability typically ignored. Healthy conditions are essential for production process, which can ensure productivity and quality; thus, deteriorating effects ...

Flexible job-shop scheduling problem derived from the job-shop scheduling problem, and is more realistic than the job-shop scheduling problem in the manufacturing enterprise. It should be utilized with high efficiency. But it is a multi-objective optimal problem. Three minimization objectives (Maximum completion time (makespan), Total workload of machines and Workload of the critical machine) a...

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

This paper suggests a decision tree based approach for flexible job shop scheduling with multiple process plans, i.e. each job can be processed through alternative operations, each of which can be processed on alternative machines. The main decision variables are: (a) selecting operation/machine pair; and (b) sequencing the jobs assigned to each machine. As an extension of the priority scheduli...

Abstract: A Quantum Genetic Based Scheduling Algorithm (QGBSA) for stochastic flow shop scheduling with random breakdown and random repair time is proposed in this paper, which combines stochastic programming and stochastic simulation theory, quantum compute and genetic algorithm together. In the QGBSA, the Q-bit based representation in discrete 0-1 hyperspace is employed, which is then convert...