In this paper, we make an improvement on McCahon and Lee’s algorithm for two-machine flow shop problem with uncertain processing time represented with fuzzy number. Especially, the scheme used in McCahon and Lee’s algorithm for ranking fuzzy processing times is modified to calculate better the minimum makespan. Example and extensive simulation results are presented to show the improved performa...

Production scheduling, with the objective of minimizing the makespan, is an important task in manufacturing systems. In the past, the processing time for each job was usually assumed to be exactly known, but in many realworld applications, processing times may vary dynamically due to human factors or operating faults. Fuzzy programming theory has been developed for flow shop scheduling problems...

The job shop scheduling problem (JSSP) is well known as one of the most difficult combinatorial optimization problems. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. The efficiency of the genetic algorithm is enhanced by integrating it with a local search method. The chromosome representation of the problem is based on operations. Schedule...

This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain opt...

This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives. A multiobjective memetic algorithm is proposed. It belongs to the integrated approach, which deals with the routing and sequencing sub-problems together. Dominance-based and aggregation-based fitness assignment methods are used ...

In this paper, we expose a new meta-heuristic based on the artificial behavior of bee colony (ABC) for solving the blocking permutation flow shop scheduling problem (BFSP) subject to regular objectives. On three main steps, the proposed algorithm iteratively solved the BFSP under three fixed measure (makespan, total flowtime, or total tardiness criterion). Discrete job permutations and operator...

Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...

flow shop sequencing problem is included in np-hard problems and a number of heuristic methods have been developed to solve it. most of these methods are offered for the crisp processing time. however fuzzy algorithm is appropriate for the problems with fuzzy processing time. this paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

Due to the increasing level of customization and globalization competition, rescheduling for distributed manufacturing is receiving more attention. In meantime, environmentally friendly production becoming a force be reckoned with in intelligent industries. this paper, energy-efficient hybrid flow-shop problem (EDHFRP) addressed knowledge-based cooperative differential evolution (KCDE) algorith...

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