A partial order on a job set is called consistent, if it has a linear extension which is an optimal solution to the total tardiness problem of the job set. The concept of proper augmentations ofâ€¦ (More)

We study the scheduling problem on a batch machine which is capable of processing a batch of jobs at a time. For a batch machine of capacity c, we designed an algorithm for minimizing the totalâ€¦ (More)

A partial order on a job set is called consistent, if it has a linear extension which is an optimal solution to the total tardiness problem of the job set. The concept of proper augmentations ofâ€¦ (More)

We study on-line scheduling on a batch machine with infinite capacity. We present a flexible on-line scheduling algorithm that aims at minimizing the makespan and achieves the optimal competitiveâ€¦ (More)

We consider the one-machine scheduling problem to minimize the number of late jobs under the group technology assumption, where jobs are classified into groups and all jobs from the same group mustâ€¦ (More)