This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local s...

In this paper we consider an NP -hard hybrid flow shop problem with machine setups and cycletime minimization. The above issue is an important generalization of a flow-shop problem with minimization of a cycle time, and it stays in a direct relationship with a flexible job shop problem. In the hybrid problem task operations are performed by machines arranged in slots, i.e., a set of machines wi...

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

Flexible job-shop scheduling problem (FJSSP) is an extension of the classical job-shop scheduling problem that allows an operation to be processed by any machine from a given set along different routes. It is very important in both fields of production management and combinatorial optimisation. This paper presents a new approach based on attribute oriented mining technique to solve the multi-ob...

Since their introduction, local search algorithms have consistently represented the state-ofthe-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a simple hybrid algorithm for job-shop scheduli...

We propose a flexible model and several integer linear programming and constraint programming formulations for integrated employee timetabling and production scheduling problems. A hybrid constraint and linear programming exact method is designed to solve a basic integrated employee timetabling and job-shop scheduling problem for lexicographic minimization of makespan and labor costs. Prelimina...

This paper presents new, carefully designed algorithms for five biobjective permutation flow shop scheduling problems that arise from the pairwise combinations of the objectives (i) makespan, (ii) the sum of the completion times of the jobs, and (iii) both, the weighted and nonweighted total tardiness of all jobs. The proposed algorithm combines two search methods, two-phase local search and Pa...

tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...