This paper presents an enhanced heuristic for minimizing the makespan of the ow shop scheduling problem with sequence-dependent setup times. The procedure transforms an instance of the problem into an instance of the traveling salesman problem by introducing a cost function that penalizes for both large setup times and bad tness of schedule. This hybrid cost function is an improvement over earl...

scheduling is an important subject of production and operations management area. in flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. the concept of transportation time is very important in scheduling. transportation can be done by robots. in situations that robots are used to transpor...

This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and sequence-dependent setup times order to minimize maximum completion time jobs. The blocking constraint normally leads an increase due blockage machines, which can even more so when are considerable. Hence, heuristic solve this must take into account these specificities t...

This article introduces a simulation study relating to the dynamic operating algorithm for the painted body storage (PBS) in an automotive factory. The manufacturing process in the trim shop of an automotive factory is a typical example of the mixed-model assembly production. In the paint shop, which comes before the trim shop, same-colored bodies are grouped together to reduce the changeover c...

We recently proposed an extension to Viĺım’s propagators for the unary resource constraint in order to deal with sequence-dependent transition times. While it has been shown to be scalable, it suffers from an important limitation: when the transition matrix is sparse, the additional filtering, as compared to the original from Viĺım’s algorithm, drops quickly. Sparse transition time matrices occ...