数学季刊 ›› 2006, Vol. 21 ›› Issue (1): 103-109.

• • 上一篇    下一篇

主次指标为最小化总完工时间和存储费用的带有准备时间的单机分批排序问题

  

  1. Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China
  • 收稿日期:2004-10-23 出版日期:2006-03-30 发布日期:2023-12-25
  • 作者简介:LI Wen-hua(1965-),female,native of Weishi,Henan,an associate professor of Zhengzhou Uni- versity,Ph.D.,engages in scheduling.
  • 基金资助:
     Supported by NSF of Henan Province(0211011000);

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);

摘要: 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.

关键词: scheduling;release , dates;hierarchical , criteria

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

中图分类号: