## Efficient neighborhood search for Just-in-Time scheduling problems

This paper addresses the one-machine scheduling problem where the objective is to minimize a sum of costs such as earliness-tardiness costs. Since the sequencing problem is NP-hard, local search is very useful for finding good solutions. Unlike scheduling problems with regular cost functions, the scheduling (or timing) problem is not trivial when the sequence is … Read more