An interesting research area is to solve scheduling problems using network flow models and algorithms. Most of the existing papers in this research area deal with scheduling problems with parallel machines (identical and / or uniform machines). This paper considers the specialized case and develops network flow models and algorithms to solve open shop and flow and job shop problems.

in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...

In the flow shop mean completion time problem, a set of jobs has to be processed on m-machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize the sum of the completion times of all jobs on the final machine. In this paper, we prove the asymptotic o...

This paper presents a bicriteria in n-jobs, three machines flow shop scheduling to minimize the total elapsed time and rental cost of the machines taken on rent under a specified rental policy in which the processing time, independent setup time each associated with probabilities including transportation time and job block criteria. Further the concept of the break down interval for which the m...

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...

We consider the multistage flexible flow shop scheduling problem with uniform parallel machines in each stage and the objective of minimizing makespan. We develop a general class of heuristics for this strongly NP-hard problem that extend several well-known heuristics for the corresponding embedded serial flow shop problem, and obtain absolute performance guarantees for heuristics in this class...

this paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. we assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. in this paper, we present an artificial imm...

Traditional flexible flow shop scheduling cannot adapt to the work processes with existence of parallel machines, and blocks or limits the processes with no-wait constraints. Firstly, according to the problem in NWBFFSSP, which minimizes the maximum time used in the flow shop, an optimal solving model has been designed to realize the flexible flow shop scheduling with multi constraints; besides...

In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...