Jueliang Hu

A rigorous approach towards test case generation

This paper presents a method to generate test cases for sequential programs and concurrent programs written in a flow based program language. Test cases of sequential programs are generated based on condition calculation, and can be combined together to form SYN-sequences for concurrent program testing. Semantics of the language provides an infrastructure for the test case generation, and thus our method may be considered as a rigorous and systematic approach to the program testing. Compared with some formal testing methods, our method can avoid hitting state explosion problem in the test formation. Besides, the complexity analysis reveals that our method is time saving. Our method has been applied to generate test cases for PPP over ATM, a subsystem of IAD that runs data and voice over DSL.

Optimal online algorithms on two hierarchical machines with tightly-grouped processing times

This paper considers an online hierarchical scheduling problem on two parallel identical machines. The objective is to minimize the makspan. It is assumed that all jobs have bounded processing times in between

Single-server parallel-machine scheduling with loading and unloading times

p

Total completion time minimization in online hierarchical scheduling of unit-size jobs

p and

A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines

rp

Machine scheduling with a maintenance interval and job delivery coordination

rp, where