Journal of Applied Sciences ›› 1998, Vol. 16 ›› Issue (1): 18-23.

• Articles • Previous Articles     Next Articles

A Polynomial Time Algorithm for Maximum Lateness in Single Machine Scheduling with Batching

SUN SHIJIE1, ANDREWS BOADI1, LIU ZHAOHUI2   

  1. 1. Shanghai Institute on Applied Mathematics and Computation, Shanghai 201800;
    2. East China University of Science and Technology, Shanghai 200237
  • Received:1996-03-01 Revised:1996-12-19 Online:1998-03-31 Published:1998-03-31

Abstract: N jobs arrive at same time and need to be processed in batches by the same machine. The jobs in the same batch are processed successively and the completion time of all the jobs in the same batch is defined as the completion time of the batch they belong to. There exists a set up time whenever the machine begins to process a new batch. Taking the maximum lateness as objective function, this paper develops a polynomial time algorithms for the processing sequence of the n jobs given or not given.

Key words: batch, polynomial time algorithm, scheduling, maximum lateness