This is a preview. Log in through your library . Abstract This paper considers the problem of scheduling n jobs, each having a processing time, a due date and a weight, on a single machine to minimize ...

The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs.