.

Экономическое обоснование организации сборочного цеха

Язык: русский
Формат: реферат
Тип документа: Word Doc
111 1784
Скачать документ

//
// ” ©« “OP_WORK.CPP”
//
#include “op_work.hpp”

unsigned char request( void )
{
unsigned char byR ;
asm {
xor ah,ah
int 16h
mov byR,al
}
return byR ;
}

double dEn_stn( int w )
{
double dE = dEn + 1.0 ;
for( int i = 1; i > dSmen ;
} while ( dSmen 3.0 ) ;
switch ( ( int ) dSmen )
{
case 1 : dKrz = 1.0 ; break ;
case 2 : dKrz = 1.25 ; break ;
case 3 : dKrz = 1.5 ;
}

cout > dN ;
cout > dCi ;
cout > dAlfa_t ;
cout > dAlfa_of ;
cout > dAveSq ;
cout > dCp ;
cout > dDpz ;
cout > dPmp ;
cout > dPh ;
cout > dDgi ;
cout > dDop ;
cout > dZAR ;
cout > iCH_ad ;
cout > iCH_vs ;

iCH_a = iCH_ad + iCH_vs ;

if ( ptrAdm ) delete[] ptrAdm ;
ptrAdm = new double[iCH_a] ;
for ( int i = 0; i > ptrAdm[i] ;
}

cout > dKpr ;

do {
cout > iNumber ;
if ( iNumber > ptrData[iCount].dTime_Norm ;
cout > ptrData[iCount].dCost ;
ptrData[iCount].dTime_Oper =
ptrData[iCount].dTime_Norm / ( 1 + ( dAlfa + dBetta ) / 100.0 ) ;
}

cout 1.1 || ( iCpi_le == 0 && 0.9 1.0 ? 1.0 : dG_n ) ;

if ( 0.9 1 && ptrData[iCount].dGree_n > D.dNa ;
D.dKu_a = D.dNa * dCa ;
} while ( D.dKu_a > D.dKu ) ;

// a acYa aa aY© ? «i?a«iae?? a aa®¤®c
D.dPzor = Entry.dKrz * ( Entry.dPh / 1000.0 ) / 60.0 * T.dTmp ;
D.dPzd = D.dPzor * dAlfa_d / 100.0 ;
D.dPsn = ( D.dPzor + D.dPzd ) * ( dAlfa_ss + dAlfa_ms + dAlfa_fz ) / 100.0 ;

double dTop_sum = 0.0 ;
for ( iCount = 0; iCount > D.dKred ;
cout > D.dAlfa_ras ;

D.dPkr = ( D.dKred * dAlfa_kr / 100.0 ) / Entry.dN ;
D.dCnp = Entry.dPmp / 1000.0 + D.dPzor + D.dPzd + D.dPsn + D.dPek +
D.dPam + D.dPnk + D.dPar + D.dPkr ;

D.dPvp = D.dCnp * dAlfa_vp / 100.0 ;
D.dPns = ( D.dCnp + D.dPvp ) * dAlfa_ns / 100.0 ;
D.dPpr = ( D.dCnp + D.dPvp ) * dAlfa_pr / 100.0 ;

D.dCn = D.dCnp + D.dPvp + D.dPpr + D.dPns ;

// a acYa ? a a?aY¤Y«Y?Y ?a?!e«?
D.dVr = Entry.dCi * Entry.dN / 1000.0 ;
D.dDs = ( Entry.dCi – Entry.dPmp ) * Entry.dN / 1000.0 ;
D.dNds = D.dDs * dAlfa_nds / 100.0 ;
D.dPr = D.dVr – D.dCn * Entry.dN – D.dNds ;

D.dFrez = D.dKu * dAlfa_res / 100.0 ;
D.dFraz = D.dPr * D.dAlfa_ras / 100.0 ;

D.dNpr = ( D.dPr – D.dFrez – D.dFraz ) * dAlfa_npr / 100.0 ;
D.dNim = D.dKu * dAlfa_im / 100.0 ;
D.dNb = D.dNds + D.dNpr + D.dNim ;
D.dNm = ( D.dPr – D.dFrez – D.dFraz ) * dAlfa_mn / 100.0 ;
D.dKR = D.dKred + D.dKred * dAlfa_kr / 100.0 ;
D.dPrp = D.dPr – D.dNpr – D.dNim – D.dKR ;
D.dPrp_T = D.dPr – D.dNpr – D.dNim ;
D.dDa = D.dNa * dCa * dAlfa_dv / 100.0 ;
D.dPno = D.dPrp – D.dDa ;
if ( D.dPno – D.dFrez >= 0.0 )
{
D.dPno -= D.dFrez ;
if ( D.dPno – D.dFraz >= 0.0 )
D.dPno -= D.dFraz ;
else
{
D.dFraz = D.dPno ;
D.dPno = 0.0 ;
}
}

// a acYa iaeaeY?a?c®aa?
D.dKob_os = D.dKob * ( 1 – dNa_ob * ( double ) iLimit / 100.0 ) ;
D.dKp_os = D.dKp * ( 1 – dNa_p * ( double ) iLimit / 100.0 ) ;

double dEn_v = dEn_stn( iLimit ) ;
double dD_sum = 0.0 ;
for( int w = 2; w 0.0 )
// a ?aY¤?a®¬
D.dEf = ( D.dPrp + D.dPam * Entry.dN ) / ( 1.0 + dEn ) +
( D.dPrp_T + D.dPam * Entry.dN ) * dD_sum +
( D.dKob_os + D.dKp_os ) / dEn_v – ( D.dKu – D.dKR ) ;
else
// !Y§ ?aY¤?a 
D.dEf = ( D.dPrp + D.dPam * Entry.dN ) * ( dEn_v – 1.0 ) /
( dEn * dEn_v ) + ( D.dKob_os + D.dKp_os ) / dEn_v – D.dKu ;

D.dEf = D.dEf 0.0 ) Stream 0.0 ) Stream = 0.0 ) Stream = D.dDa ) Stream = 0.0 ) Stream = 0.0 ) cout = 0.0 ) cout = D_2.dEf )
cout = D_2.dEf )
f_out = D_2.dEf ) CalcTS( &Entry, &T_1, this, f_out ) ;
else CalcTS( &Entry, &T_2, this, f_out ) ;

f_out.close() ;
clrscr() ;
}
//*************************************************************************

main()
{
ENTRY_DATA EntryData ;
TECH_PRO Tpr_1 ;
TECH_PRO Tpr_2 ;
DATA_F D_1 ;
DATA_F D_2 ;

cputs( “\n\r Dec. 1993 Satur ventur non studit libentur ltd. ” ) ;
delay( 700 ) ;
clrscr() ;

RESULT Result( EntryData, Tpr_1, Tpr_2, D_1, D_2 ) ;

return 5 ;
}

int NOK( int n, int* v )
{
int numbers = n ;
int nok = 1 ;
while ( nok++ )
{
for ( int i = 0; i > num ;
bError = (numiNum_operations);
if (bError) cout > info[j] ;
if (info[j]TP->iNumber || check_info[info[j]-1])
{
cout ptrData[info[j]-1].iCi ;
}
n = NOK( num, Ci ) ;
}

class MARKS
{
public :
int nCol ; //c?a«® ai¤®c
int max;
MARK_INFO *mi ;
TECH_PRO *TP ;

void Out( ostream& ) ;
void OutTable( ostream&, GREATE_EXECUTOR* ) ;
MARKS( istream& istr, ostream& ostr, TECH_PRO* ) ;
~MARKS() { delete mi ; }
}; /* class MARKS */

void MARKS::Out( ostream& ostr )
{
int i,j;
ostr TP->iNumber; nop++ )
{
if (nop!=1) ostr TP->ptrData[nop-1] ) ;
int nrmo = Data->iCi ;
int col ; //®¬Ya ai¤  ¤«i ®?Ya ae??
for ( int k = 0; k iNumber; i++ )
cout ptrData[i].iCi > nCol ;
mi = new MARK_INFO[nCol] ;
max = 0 ;
setmem(check_info,sizeof(int)*10,0×0); ;
iNum_operations=tp->iNumber;
for ( i = 0; i max ) max = mi[i].n ;

for ( i = 0; i = mi[i].n ) index = 0 ;
}
}
}

void GREATE_EXECUTOR::Mark( istream& istr, ostream& ostr )
{
MARKS *MM = new MARKS( istr, ostr, TP ) ;
MM->Out(cout);
do {
cout Out(cout);
continue ;
}
break ;
} while ( 1 ) ;
MM->Out(ostr);

MM->OutTable( ostr, this ) ;
}

int GREATE_EXECUTOR::OutResult( ostream& ostr, int qw )
{
clrscr();
ostr > s ;
cout > d ;
if (d==0 || s==0.0) goto contin;
Up = s/tau; Up = s/tau;TestUp();
l=s*d;
C=0;
for (int i=0;iiNumber;i++)
{C+=TP->ptrData[i].iCi;
TP->ptrData[i].li=s*TP->ptrData[i].iCi;
}
Lp=l*(C+1);
Lm=2.5;
Lns=2*Lp+Lm;
q= ((2*Lp+Lm)/(s*n0)+0.5);
Ln=q*s*n0;
e = (Ln-Lns)/Ln;e= (e5) strcpy(Msg,” ‘«?e?®¬ !eaaa®Y ¤c?¦Y?Y “) ;
else strcpy(Msg,” ˜Y?®¬Y¤aYaai Y?aYaec®Y ¤c?¦Y?Y “) ;
}

double GREATE_EXECUTOR::Takt() { return tau=R->dTau ; }

int GREATE_EXECUTOR::NOK_Ci() // ?¬YieYY ®!eYY ?a a®Y
{
int numbers=TP->iNumber;
int nok=1;
while (nok++)
{
for (int i=0;iptrData[i].iCi;
if ( (((double)nok/(double)Ci) – ((double)(nok/Ci))) != 0.0)
goto inc;
}
break;
inc:;
}
return n0=nok;
}

void CalcTS(ENTRY_DATA *ed,TECH_PRO *tp,RESULT *r,ostream &ostr)
{
clrscr();
GREATE_EXECUTOR(ed,tp,r,ostr);
ostr iNumber; i++ )
ostr ptrData[i].iCi ptrData[i].dTime_New/r->dTau)

Нашли опечатку? Выделите и нажмите CTRL+Enter

Похожие документы
Обсуждение

Ответить

Курсовые, Дипломы, Рефераты на заказ в кратчайшие сроки
Заказать реферат!
UkrReferat.com. Всі права захищені. 2000-2020