作者	万国华
出版社
出版时间	2004-08-01

特色：
The second one is a single machine scheduling problem with distinct due windows to minimize total weighted earliness and tardiness. A mathematical formulation i s presented and several important properties of the problem are studied. Then an optimal timing algorithm to decide job completion times for a given job sequenc e is proposed. The Tabu search scheme is employed together with the optimal timi ng algorithm to generate job sequences and final schedules. Several experiments were designed and carried out to demonstrate the performance of the proposed app roach.

The first one is a single machine scheduling problem to minimize the total weigh ted earliness subject to minimal number of tardy jobs. First, several properties of the problem are discussed in analyzing the problem. Then, a heuristic algori thm of time complexity O(n2) and an efficient branch and bound algorit hm a re proposed. The computational experiments show that the heuristic algorithm is effective in terms of quality of the solutions in most instances while the b ranch and bound algorithm is efficient for medium sized problems. 