In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in case of a regular criterion to be minimized. We show that solutions having a permutation flow shop structure are dominant if there exists an optimal solution with completion times scheduled in the same order as the release dates, or if there is no release date. We also prove t...

This paper presents makespan algorithms and scheduling heuristic for an Internet-based collaborative design and manufacturing process using bottleneck approach. The collaborative manufacturing process resembles a permutation re-entrant flow shop environment with four machines executing the process routing of M1,M2,M3,M4,M3,M4 in which the combination of the last three processes of M4,M3,M4 has ...

The first Cross-domain Heuristic Search Challenge (CHeSC 2011) is an international research competition aimed at measuring hyperheuristics performance over several problem domains. Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. During this competition, we have applied the Ant-Q hyper-heuristic approach, propose...

In the paper an improvement heuristic is proposed for permutation flow-shop problem based on the idea of evolutionary algorithm. The approach employs constructive heuristic that gives a good initial solution. GA-based improvement heuristic is applied in conjunction with three well-known constructive heuristics, namely CDS, Gupta’s algorithm and Palmer’s Slope Index. The approach is tested on be...

In order to solve the permutation flow shop scheduling problem, a multipopulation and self-adaptive genetic algorithm based on simulated annealing is proposed in this paper. For the precocity problem of traditional genetic algorithm, the multi-population coevolution strategy is adopted. We introduce a squared term to improve traditional self-adaptive genetic operators, which can increase the se...

Permutation flow-shop scheduling is the strategy that ensures processing of jobs on each subsequent machine in exact same order while optimizing an objective, which generally minimization makespan. Because its NP-Complete nature, a substantial portion literature has mainly focused computational efficiency and development different AI-based hybrid techniques. Particle Swarm Optimization (PSO) al...

Flow-shop scheduling problems are classic examples of multi-resource and multi-operation optimization problems. This paper demonstrates our model simulation for solving with resource availability constraints to minimize makespan. Working hours, transfer times setup taken into account. hours could be interpreted in two ways. In the first option, operations must fit a single available time slot. ...

In this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization of the total tardiness. The model is tested against random instances. The results allow us to identify the effect of some parameters such as c...

In this study, we consider a permutation flow shop scheduling problem on a three-machine with deteriorating jobs (a deteriorating job means that the job’s processing time is an increasing function of its starting time) so as to minimize the makespan. We model job deterioration as a function that is proportional to a linear function of time. For some special cases, we prove that the problem can ...

This paper considers a variant of the relocation problem, which is formulated from an urban renewal project. There set jobs to be processed in two-machine flow shop subject given initial resource level. Each job consumes some units start its processing on machine 1 and will return amount when it completed 2. The released by not necessarily equal acquired for starting process. Subject constraint...