We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the number of iterations between dependencies. We design a novel and flexible technique, called rotation scheduling, for scheduling cyclic DFG’s using loop pipelining. The rotation technique repeatedly transforms a schedule to a mo...

The term flexible flow line (FFL) denotes a generalization of the standard flow shop where at least one stage comprises more than one machine. We present a scheduling algorithm for the FFL which minimizes a combination of job tardiness and machine utilization. To our knowledge, this is the first exact method that minimizes a tardiness based objective function for the given production facility. ...

In this paper, we propose a water flow algorithm for solving flexible flow shop scheduling problem with limited intermediate buffers, which is a NP-hard problem encountered in industry. The proposed algorithm is inspired by the hydrological cycle in meteorology and the erosion phenomenon in nature. In the algorithm, we combine the amount of precipitation and its falling force to form a flexible...

scheduling is an important subject of production and operations management area. in flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. the concept of transportation time is very important in scheduling. transportation can be done by robots. in situations that robots are used to transpor...

This paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. Since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...

In this paper, four algorithms based on some single-pass heuristics are proposed to solve the flexible flow-shop group scheduling problems with more than two machine centers, which have the same number of parallel machines. Single-pass heuristics need less computation time than multiple-pass ones. The single-pass heuristics adopted in the paper includes the PT, the Palmer and the Gupta algorith...

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...

A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...

In this paper a new approach is presented to solve multi-objective production scheduling and rescheduling problems. Furthermore the relationship between production goals and heuristic solving methods in an extended flexible flow shop environment is also investigated. We define production goals by specifying objective functions and apply special production constraints for the extended flow shop ...