In this work, multicriteria decision making objective for flow shop scheduling with sequence dependent set up time and due dates have been developed. Multicriteria decision making objective includes total tardiness, total earliness and makespan simultaneously which is very effective decision making for scheduling jobs in modern manufacturing environment. As problem of flow shop scheduling is NP...

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, we study a flow shop batch processing machines scheduling problem. the fuzzy due dates are considered to make the problem more close to the reality. the objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. in order to tackle the given problem, we propose a hybrid electromagnetism-like (em) algorithm, in which the em is hybridized with a diversi...

this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga a...

Flow shop problems as a typical manufacturing challenge have gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, where weighted mean completion time and weighted mean tardiness are to be minimized simultaneously. Since a flow shop scheduling problem has been proved to be NP-hard in strong sense, an effective multi-objectiv...

In this paper a hybrid genetic and harmony search algorithm is proposed to find the possible best sequence of operation solutions for hybrid flow shop scheduling problems. In this work the problem is considered with respect to the objective of minimization of makespan. Hybrid flow shop scheduling problem is considered for the sequencing of jobs in a hybrid flow shop with two or more identical m...

This paper presents a state of the art overview on Ants Systems. Initially the work proposes the fundamental concepts of Ants Theory and offers a description of the main algorithms (based on Ants Theory) and the respective fields of application. Among different fields of application, the paper focuses on industrial plants scheduling problems in open shop, flow shop and job shop systems. The las...

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

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

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