Chinese Quarterly Journal of Mathematics ›› 2006, Vol. 21 ›› Issue (1): 103-109.

Previous Articles     Next Articles

Single Machine Scheduling Problem with Release Dates and Two Hierarchical Criteria to Minimize Makespan and Stocking Cost

  

  1. Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China
  • Received:2004-10-23 Online:2006-03-30 Published:2023-12-25
  • About author:LI Wen-hua(1965-),female,native of Weishi,Henan,an associate professor of Zhengzhou Uni- versity,Ph.D.,engages in scheduling.
  • Supported by:
     Supported by NSF of Henan Province(0211011000);

Abstract: In this paper, the single machine scheduling problem with release dates and two hierarchical criteria is discussed. The first criterion is to minimize makespan, and the second criterion is to minimize stocking cost. We show that this problem is strongly NP-hard. We also give an O(n2) time algorithm for the special case that all stocking costs of jobs in unit time are 1.

Key words: scheduling;release , dates;hierarchical , criteria

CLC Number: