An optimization model and its algorithm for job-shop scheduling problems

The paper presents an optimization model with a general form for jobshop scheduling problems, which are formulated into bilevel programming. Minimizing earliness penalty lot-streaming problem and earliness/tardiness scheduling lot-streaming problem are studied as the model's two special cases. At last an efficient and practical algorithm is given and numerical experiments show the correctness of the model and the efficiency of the algorithm.