this paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. in addition, the setup time of a job on each machin...

We consider a situation where C customers each order various quantities (possibly zero in some cases) of products from P different families, which can be produced on a continuously available machine in any sequence (requiring a setup whenever production switches from one family to another). We assume that the time needed for a setup depends only on the family to be produced immediately after it...

In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O n n m + 1 m time dynamic programming algorithm and an O(mk k P 2k−1) time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of di...

This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed integer programming model capable of solving small sized problems is described. Several heuristic algorithm...