Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....

While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we in this work mixed integer formulations. We consider a single machine problem that aims at minimizing the weighted sum of earliness–tardiness penalties around common due date. Using natural variables, provide one compact formulation for unrestrictive case and, gene...

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...

In this chapter the authors address a hybrid flow shop scheduling problem considering the minimization of the makespan in addition to the sum of earliness and tardiness penalties. This problem is proven to be NP-hard, and consequently the development of heuristic and meta-heuristic approaches to solve it is well justified. So, to deal with this problem, the authors propose a method which consis...

We propose a column generation based exact decomposition algorithm for the problem of scheduling n jobs with an unrestrictively large common due date on m identical parallel machines to minimize total weighted earliness and tardiness. We rst formulate the problem as an integer program, then reformulate it, using Dantzig-Wolfe decomposition, as a set partitioning problem with side constraints. B...