This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search approaches for these problems has focused on developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such do...

of doctoral thesis entitled GA-BASED CONTROL OF MULTIOBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROCESSES Doctoral student: math. ec. ELENA SIMONA NICOARĂ Doctoral advisor: prof. NICOLAE PARASCHIV In the beginning of this work, the manufacturing systems are hierarchically approached on three levels: the first one corresponds to the global enterprise, the second one to the production planning sector...

The flexible job shop scheduling problem (FJSP) is one of the most difficult NP-hard combinatorial optimization problems. It is extremely difficult to solve the FJSP with the disturbances of manufacturing environment, which is always regarded as the flexible job shop online scheduling problem. This paper proposes a new method based on Process-Tree to solve this type of scheduling problem. Proce...

In the multi-mode resource-constrained multi-project scheduling (MMRCMPSP) problem we have to find execution modes and starting times for the jobs of multiple projects, such that the total project delay is minimized. The delay of a project is the difference between its makespan and a lower bound on its duration. A secondary objective is to minimize the total makespan of all projects. The jobs o...

This paper develops a fast tabu search algorithm to minimize makespan in a flow shop problem with blocking. We present a fast heuristic algorithm based on tabu search approach. In the algorithm the multimoves are used that consist in performing several moves simultaneously in a single iteration of algorithm and guide the search process to more promising areas of the solutions space, where good ...

The flexible job shop scheduling problem (FJSP) is an extension of the classical and one more well-known NP-hard problems. To get better global optima FJSP, a novel hybrid whale optimization algorithm (HWOA) proposed for solving in which minimizing makespan considered as objective. Firstly, uniformity extensiveness initial population distribution are increased with good point set (GPS). Secondl...

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

The specific goal of this paper is to present an efficient heuristic for n-jobs, two machine open shop scheduling involving job block criteria and weights of jobs due to their relative importance, under the condition when probabilities are associate with processing time to obtain an optimal or near optimal sequence which minimize the makespan. The proposed heuristic developed in this paper is s...

Volvo Aero has invested in a complex production cell containing a set of multipurpose machines. The problem of finding optimal schedules for this multitask cell is a complex combinatorial optimization problem which is recognized as a flexible job shop problem. This thesis proposes an approach to find such schedules using mathematical optimization. The mathematical models developed so far are pr...

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...