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

作     者：LI Wen-hua LI Wen-hua

作者机构：Department of Mathematics Zhengzhou University Zhengzhou 450052 China 

出 版 物：《Chinese Quarterly Journal of Mathematics》 (数学季刊（英文版）)

年 卷 期：2006年第21卷第1期

页      面：103-109页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：Supported by NSF of Henan Province(0211011000) 

主　　题：scheduling release dates hierarchical criteria 

摘      要：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（n^2） time algorithm for the special case that all stocking costs of jobs in unit time are 1.