The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. Each batch comprises two sub-batches processed consecutively. In the first subbatch, all the items are newly manufactured. Some of them are of the required good quality and some are defective. The defective items are re...

We consider a graph whose vertices are legally colored using k colors and ask if the contains -clique. As it turns out this very special type of -clique problem is in an intimate connection with constructing schedules. The practicality clique search based construction schedules checked by carrying numerical experiments.