In terms of characteristics of flexible job-shop scheduling problem, the complementary constraint models, including priority among different jobs and parent-child relations of relevant jobs, are established based on two objective function of minimizing makespan for all jobs and the sum of standard deviation of processing workload for all working centers. Aiming at the above model, a hybrid gene...

In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Paretooptimal s...

In this paper, flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid evolutionary algorithm is proposed to obtain a large set of Pareto-op...

A flow line is a conventional manufacturing system where all jobs must be processed on all machines with the same operation sequence. Line buffers allow non-permutation flowshop scheduling (NPFS) and job sequences to be changed on different machines. A mixed-integer linear programming model for non-permutation flowshop scheduling and the buffer requirement along with manufacturing implication i...

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

The job shop scheduling problem JSSP is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more important because they are essential for maintaining a high service reputation. Therefore, in this study...

Batch processing becomes more important in the process industries, because of the increasing product variety and the decreasing demand volumes for individual products. In batch process industries it is difficult to predict the completion time, or makespan, of a set of jobs, because jobs interact at the shop floor. In this paper, we compare two different methods for predicting the makespan of jo...

The problem of nonpreemptively scheduling a set of rn partially ordered tasks on n identical processors subject to interprocessor communication delays is studied in an effort to minimize the makespan. A new heuristic, called Earliest Task First (ETF), is designed and analyzed. It is shown that the makespan wEx-generated by ETF always satisfies to Eq.. (2 1/n wopti) + C, where Wopti) is the opti...

We study temperature-aware scheduling problems under the model introduced by Chrobak et al. in [6]. We consider a set of parallel identical processors and three optimization criteria: makespan, maximum temperature and (weighted) average temperature. On the positive side, we present polynomial time approximation algorithms for the minimization of the makespan and the maximum temperature, as well...

− This paper presents an approach to model and optimize the activities of a manufacturing workstation based on a Petri structure. To model the workstation activities a comprehensive hierarchical task decomposition consistent with manufacturing control requirements is followed. We also introduce the concept of time-state equations for tracking and optimization purposes. In order to optimize the ...