Being complex and combinatorial optimization problems, Permutation Flow Shop Scheduling Problems (PFSSP) are difficult to be solved optimally. PFSSP occurs in many manufacturing systems i.e. automobile industry, glass paper appliances pharmaceutical the generation of best schedule is very important for these systems. Evolution Strategy (ES) a subclass Evolutionary algorithms this paper, we prop...

In the field of scheduling, the flowshop problems have been thoroughly studied over the last six decades. In this paper we propose a concise overview of flowshop scheduling techniques evolved during this period. We surveyed the exact, heuristics and metaheuristics methods for solving various flowshop scheduling problems. As a result various optimization techniques, solution procedures are avail...

We propose a framework to control the search for solutions by relaxation, reduction , and decomposition of scheduling problems. Scheduling problems are regarded as Constraint Satisfaction Problems (CSPs) which are represented by sets of constraints. We introduce the notion of subquadrangle and show how to represent any constraint by intersections and unions of subquadrangles. This allows us to ...

Planning and scheduling are areas attracting an unceasing attention of computer science community. However, despite of their similar character, planning and scheduling problems are usually handled independently using different methods and technologies. While Artificial Intelligence technology is more relevant for planning problems, Operations Research has a long tradition in studying scheduling...

The planning of Manufacturing Systems involves frequently the resolution of a huge amount and variety of combinatorial optimization problems with a important impact on the performance of manufacturing organizations. The proposed approach is in line with reality and away from the approaches that deal with static and classic or basic Job-Shop scheduling problems. In fact, in real world, where pro...

Traditionally, scheduling research is concerned with the sequencing of tasks on one machine or on several parallel or different machines, subject to a set of constraints. Over the years, researchers have studied a huge variety of problems, developing numerous heuristics, approximation and exact algorithms, and complexity results. Some of these problems are interesting because of their intractab...

Mathematical programming, constraint programming and computational intelligence techniques, presented in the literature in the field of operations research and production management, are generally inadequate for planning real-life production process. These methods are in fact dedicated to solving the standard problems such as shop floor scheduling or lot-sizing, or their simple combinations suc...

We discuss what we consider to be the ten most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Prologue In the early days of scheduling, the work of the theoretical research branch mainly consist...