This paper studies the flowshop scheduling problem with a complex bicriteria objective function. A weighted sum of makespan and maximum tardiness subject to a maximum tardiness threshold value is to be optimized. This problem, with interesting potential applications in practice, has been sparsely studied in the literature. We propose global and local dominance relationships for the three machin...

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...

In this paper, we are discussing a research project aiming to optimize the scheduling of production orders within real application in packaging field. As first approach, model problem as an extended version hybrid and flexible flowshop with precedence constraints, parallel machines, sequence-dependent setups. The optimization objective considered is minimization total tardiness. To tackle probl...

This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total completion time and the maximum tardiness. In this article, a branch-and-bound method, incorporating several dominance properties and a lower bound, is presented to search for the exact solution for small j...

We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is specially ...

In this paper, we address a new integration of column generation and Lagrangian relaxation for solving flowshop scheduling problems to minimize the total weighted tardiness. In the proposed method, the initial columns are generated by using near-optimal dual variables for linear programming relaxation of Dantzig-Wolfe decomposition derived by the Lagrangian relaxation method. The column generat...

Real-world versions of the permutation flowshop scheduling problem (PFSP) have a variety of objective criteria to be optimized simultaneously. Multi-objective PFSP is also a relevant combinatorial multi-objective optimization problem. In this paper we propose a multiobjective evolutionary algorithm for PFSPs by extending the previously proposed discrete differential evolution scheme for single-...

Lagrangian relaxation technique is successfully applied to solve sequence dependent setup time flowshop problem to minimize the total weighted tardiness. The relaxed problem can be decomposed into each job-level subproblem that can be effectively solved by dynamic programming. Two types of the additional constraints for the violation of sequence dependent setup time constraints are imposed to t...

This paper addresses the two-machine permutation flowshop problem with deterioration. The objectives are minimizing makespan and average tardiness. Jobs have a baseline process time in each machine due date. actual to job depends on performance level at start of job, which is function previously processed jobs their wear/deterioration effect machine. article proposes multiple heuristics compreh...

Nowadays many industry consider an interval time as a due date instead of precise points in time. In this study, the hybrid flow shop scheduling problem with basic blocking constraint is tackled. Where jobs, if done within window, are deemed on Therefore, criterion to minimize sum weighted earliness and tardiness. This variant flowshop not investigated best our knowledge. we introduced new meta...