This paper aims to introduce System Dynamics (SD) in applying Drum Buffer Rope (DBR) methodology of Theory of Constraints (TOC) in a three-stage flow shop system that produces a single product. To the best of our knowledge, although there are a lot of TOC applications using discrete simulation in production scheduling with DBR methodology, there are not any TOC application of DBR methodology in...

This paper studies a combinatorial optimization problem which is obtained by combining the two-machine flow shop scheduling problem and the shortest path problem. The objective of the obtained problem is to select a subset of jobs constitutes a feasible solution to the shortest path problem, and to execute the selected jobs on two-machine flow shop to minimize the makespan. We argue that this p...

In this work, we suggest a Multi-Agent model based on a tabu search method for solving the permutation flow shop scheduling problem. The problem is strongly NP-hard and its resolution optimally within a reasonable time is impossible. The objective of this work is to minimize the makespan or the total duration of the schedule. The proposed model is composed of two classes of agents: Supervisor a...

The assumption of classical shop scheduling problems that each job visits each machine only once (Baker, 1974) is often violated in practice. A new type of manufacturing shop, the reentrant shop has recently attracted attention. The basic characteristic of a re-entrant shop is that a job visits certain machines more than once. For example, in semiconductor manufacturing, consequently, each wafe...

We consider the open shop scheduling problem with uncertain durations modelled as fuzzy numbers. We define the concepts of necessary and possible β-robustness of schedules and set as our goal to maximise them. Additionally, we propose to assess solution robustness by means of Monte Carlo simulations. Experimental results using a genetic algorithm illustrate the proposals.

This paper addresses the issue of how to best execute the schedule in a two-phase scheduling decision framework by considering a two-machine flow-shop scheduling problem in which each uncertain processing time of a job on a machine may take any value between a lower and upper bound. The scheduling objective is to minimize the makespan. There are two phases in the scheduling process: the off-lin...

This paper is concerned with hybrid flow-shop scheduling problem involving multiprocessor tasks. The hybrid flow-shop problem is a generalization of the classical flow-shop problem by permitting multiple parallel processors at each stage of task processing. The multiprocessor tasks, on the other hand, overcome the restriction of the classical scheduling problems by allowing tasks to be processe...

Fine-grained accelerators have the potential to deliver significant benefits in various platforms for embedded signal processing. Due to the moderate complexity of their targeted operations, these accelerators must be managed with minimal run-time overhead. In this paper, we present a methodology for applying flow-shop scheduling techniques to make effective, lowoverhead use of fine-grained DSP...

Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the total work-in-process inventory. Job scheduling problems are one of the oldest and real world combinational optimization problems. It is multi objective and complex in nature. There exist some criteria that must be taken into consideration when evaluating the quality of the proposed schedule. Consideration of jo...