In this article, we present a study that compares variants of two ACO algorithms designed to tackle a biobjective permutation flowshop scheduling problem where the makespan and the total tardiness are the objectives considered. These two algorithms use respectively one and two pheromone matrices. The analysis of the results gives indications on the choices to adopt when designing an ACO approac...

We consider flowshop environments that consist of multiple stages and multiple machines in each stage. The flowshops are flexible in the sense that a task within a stage can be processed by any of the machines in the stage. We refer to this design as the hybrid flowshop. Our objective is to schedule a set of n jobs so as to minimize makespan. The problem is NP-complete even in the case of a sin...

In this paper, a general multi-level decomposition based framework has been proposed for integration of planning and scheduling in a multi-site, multi-product plant, with applications to paper manufacturing. The problem involves complex issues relating to large-scale production in a hybrid flowshop configuration, decisions relating to minimizing trim losses, while maintaining on-time delivery o...

This paper focuses on the flowshop scheduling problem with sequence dependent setup times (FSSP-SDST), which has been an investigated object for decades as one of the most popular scheduling problems in manufacturing systems. A novel hybrid local search algorithm called HLS is presented to solve the flowshop scheduling problem with sequence dependent setup times with the criterion of minimizing...

In this paper, we address a two-stage hybrid flowshop scheduling problem with identical parallel machines in each stage. The assumes that the queue (Q)-time for job, which represents waiting time to be processed current stage, must limited predetermined threshold due quality concerns final product. This is motivated by one occurs real field, especially diffusion workstation of semiconductor fab...

In this paper, we consider a manufacturing system with two-machine no-wait flowshop scheduling problem where setup times are uncertain. The the performance measure of maximum lateness was addressed in literature (Computational and Applied Mathematics 37, 6774-6794) dominance relations were proposed. We establish new relation show that is, on average, about 90$ \% $ more efficient than existing ...