In the restricted single-machine common due date problem the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties, while for the weighted tardiness problem the goal is to find…

Determining an optimal schedule to minimize the completion time of the last job abandoning the system (makespan) becomes a very difficult problem when there are more than two machines in the flow shop. Due both to its economical impact and…

In a production system it is usual to stress minimum tardiness to achieve higher client satisfaction.
According to the client relevance, job processing costs and requirements, and various other considerations, a weight is assigned to each job. An important, non-trivial,…

In an m-machines n-jobs flow-shop sequencing problem each job consists of m operations and each operation requires a different machine, so n jobs have to be processed in the same sequence on m machines. The processing time of each job…