This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.

In this paper,we consider a semi on-line scheduling problem on two uniform machines with machine available times,where the objective is to minimize makespan of the schedule.

In the first case, if the machines are uniform ones with available time, we assume that the total processing time is known in advance.

In the paper,we consider a semi-on-line scheduling problem on two uniform machine system(different machine speed) with different machine available time,to reach the purpose optimizing availability,where the objective is to minimize makespan of the schedule.

This paper considers the open shop scheduling problems with job priorities and release times.

It was proposed that all release times existed and all processing times were constant,the problem was still NP-hard in the strong sense.

On the complexity of the two-machine open shop problem with delays and release times;

The paper presents open-shop scheduling problem with release times and job priorities, we give a simple heuristic and prove that its worst-case performance is 4/3, the bound is tight.

We consider the m-machine flow-shop problem with release times and we prove the worst-case performance is m+12.

The difference in planning tim

Based on an investigation of the performance of 20 high learners and 20 low learners in a written task with/without planning time,we analyzed the influence of planning time and language proficiency on learners\' written accuracy.