This paper presents a comprehensive approach for minimizing makespan in the challenging two-stage hybrid flowshop with dedicated machines, problem known to be strongly NP-hard. study proposed constraint programming approach, novel heuristic based on priority rule, and Tabu search procedures tackle this optimization problem. The model, implemented using commercial solver, serves as exact resolut...

This study considers scheduling in Hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. This problem does not study in the literature, so far. Flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. After modeling the p...

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...

In this article we present an Ant Colony Optimization approach to the Flow Shop Problem. ACO is a new algorithmic approach, inspired by the foraging behavior of real ants, that can be applied to the solution of combinatorial optimization problems. Artificial ants are used to construct solutions for Flow Shop Problems that subsequently are improved by a local search procedure. Comparisons with o...

In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Recently, group scheduling has also been proposed and discussed. In the group scheduling, each job belongs to a specific group and all the jobs are processed group by group. In this pape...

in this study, a two-objective mixed-integer linear programming model (milp) for multi-product re-entrant flow shop scheduling problem has been designed. as a result, two objectives are considered. one of them is maximization of the production rate and the other is the minimization of processing time. the system has m stations and can process several products in a moment. the re-entrant flow sho...

In this paper we present the integration of an ant-based algorithm with a greedy algorithm for solving the scheduling of a multi-stage plant. A multi-stage manufacturing plant is comprised of different stages: mixing, storage, packing and finished goods storage, and is an extension of the classic Flow Shop Scheduling Problem (FSP). The algorithmic details for the Multi Stage Flow Shop Schedulin...

this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...