[9]Mor B,Mosheiov G.Scheduling a maintenance activity and due-window assignment based on commom flow allowance[J].International Jouranl of Production Economics.2012.135(1):220-230.
[10] Hsu C J,Yang S J,Yang D L. Two due date assignment problems with position- dependent processing time on a single-machine[J]. Computers & Industrial Engineering,2011,60(4):796–800.
[11] Cheng T C E, Oguz C,Qi X D. Due-date assignment for scheduling on a single machine with compressible processing time[J].Internatio
nal Journal of Production Economics.1996,43(2):107-113.
[12] Shabtay D, Steiner G. The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times[J]. Annals of Operations Research,2008,159(1):25-40.
Scheduling problem is an improtan combinatorial opti-zation problem.Scheduling problem is widely applied impr-otant problems in combinatorial optimization.The schedul-ing of tasks according to production objectives and constr-aints,to detemine the specific processing route,time,mac-hine and operation eachobject processing.
Good scheduling strategy has a great role in improve economic benefits.But due to the coexistence of resource constraints and technological constaints,so the computati-onal complexity theory shows that,most scheduling problr-m belongs to NP a hard(Nondeter ministiepolynomial Har-d,non deteministicpolynomial) problem target search rela-tes to the combinatorial explosion of the solution space.S-orting algorithm of the comprtitive ratio analysis is the so-ft of algorithm the risks of a assessment and security,has the important theory significance and practical value.
This paper discusses the single machine scheduling p-roblem with controllable processing time of delivery and t-he workplece.According to the properties the optimal res-ource allocation method and the problem can be converte-d to assigment problem by construting a polynomial time ,Algorithm to detemine the optimal ordering and the learn-ing effect and problem with controllable processing times Respectively discusses the processing time is a linear res-ource functions and convex resource function in two case-sproved that this kind of problem is polynomial time solv-able finally discussed a special case study factor is consta-nt processing time is a convex resource function gives co-mplexity is O(nlog n)algorithm by running this algorithm .To detemine the optimal resource allocation optimal quan-tity and parts of the soft.
Key words:the single machine scheduling,delivery p-eriod,controllable processing times,resource allocation.