Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

This paper presents a bi-objective MIP model for the flexible flow shop scheduling  problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...

Lot sizing and scheduling in flow shop has been considered in this paper. Our study includes a multi-level and multi-period capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setups, setups carry over in flow shop. In manufacturing environments backlogging is unavoidable. If the production capacity is infinite, any demand can be satisfied

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...

A set J of n jobs has to be scheduled in a manufacturing system with two stages (machining centers) Z1 and Z2. Each stage Zi (i = 1, 2) has mi identical machines in parallel (with max(m1, m2) ≥ 2). Each job j (j = 1, ..., n) has to be processed first for aj units of time by one machine of Z1, and then for bj units of time by one machine of Z2. These operations must be processed without preempti...

Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple f...

In this paper we are to present a practical application of Axiomatic Design (AD) methodology, as a roadmap to lean production, in redesigning a car body assembly line. Axiomatic Design theory provides a framework to simplify the whole problem. According to the AD principles, a hierarchical structure has been developed. The developed structure originated in lean manufacturing principles and exis...

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

Changes in equipment and production demand cannot be predicted at the design stage. Therefore, decision taking mechanisms must rely on real time information collected from the shop floor. To perform scheduling and routing optimization, not only modifications in values of parameters of interest, but also in the flow itself must be accounted for. This paper addresses this problem and proposes a m...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...