Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("INTEGRATED PLANNING")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2296

  • Page / 92

Export

Selection :

  • and

LOWER BOUNDS FOR ON-LINE TWO-DIMENSIONAL PACKING ALGORITHMSBROWN DJ; BAKER BS; KATSEFF HP et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 2; PP. 207-225; BIBL. 11 REF.Article

EQUALIZATION OF RUNOUT TIMESKARMARKAR US.1981; OPER. RES.; ISSN 0030-364X; USA; DA. 1981; VOL. 29; NO 4; PP. 757-762; BIBL. 10 REF.Article

FAST APPROXIMATION ALGORITHM FOR JOB SEQUENCING WITH DEADLINESGENS GV; LEVNER EV.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 4; PP. 313-318; BIBL. 8 REF.Article

ON NON-PREEMPTIVE STRATEGIES FOR STOCHASTIC SCHEDULING PROBLEMS IN CONTINUOUS TIMEGLAZEBROOK KD.1981; INT. J. SYST. SCI.; ISSN 0020-7721; GBR; DA. 1981; VOL. 12; NO 6; PP. 771-782; BIBL. 6 REF.Article

COMPLEXITY RESULTS FOR SCHEDULING CHAINS ON A SINGLE MACHINELENSTRA JK; RINNKOOY KAN AHG.1980; EUROP. J. OPERAT. RES.; NLD; DA. 1980; VOL. 4; NO 4; PP. 270-275; BIBL. 19 REF.Conference Paper

SCHEDULING JOBS SUBJECT TO NONHOMOGENEOUS POISSON SHOCKSPINEDO ML; ROSS SM.1980; MANAGE. SCI.; ISSN 0025-1909; USA; DA. 1980; VOL. 26; NO 12; PP. 1250-1257; BIBL. 3 REF.Article

SEQUENCING INDEPENDENT JOBS WITH A SINGLE RESOURCEBAKER KR; NUTTLE HLW.1980; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1980; VOL. 27; NO 3; PP. 499-510; BIBL. 15 REF.Article

COMPLEXITY OF SCHEDULING SHOPS WITH NO WAIT IN PROCESSSAHNI S; CHO Y.1979; MATH. OPER. RES.; USA; DA. 1979; VOL. 4; NO 4; PP. 448-457; BIBL. 19 REF.Article

A SPECIAL CASE OF THE 3 X N FLOW SHOP PROBLEM.BURNS F; ROOKER J.1976; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1976; VOL. 22; NO 4; PP. 811-817; BIBL. 5 REF.Article

COUNTEREXAMPLES TO OPTIMAL PERMUTATION SCHEDULES FOR CERTAIN FLOW SHOP PROBLEMSPANWALKAR SS; SMITH ML; WOOLLAM CR et al.1981; NAV. RES. LOGIST. Q; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 2; PP. 339-340; BIBL. 5 REF.Article

ON SINGLE-MACHINE SCHEDULING WITH PRECEDENCE RELATIONS AND LINEAR OR DISCOUNTED COSTSGLAZEBROOK KD; GITTINS JC.1981; OPER. RES.; ISSN 0030-364X; USA; DA. 1981; VOL. 29; NO 1; PP. 161-173; BIBL. 13 REF.Article

SINGLE MACHINE SCHEDULING WITH SERIES-PARALLEL PRECEDENCE CONSTRAINTSBURNS RN; STEINER G.1981; OPER. RES.; ISSN 0030-364X; USA; DA. 1981; VOL. 29; NO 6; PP. 1195-1207; BIBL. 4 REF.Article

A HYBRID ALGORITHM FOR INDEPENDENT TASK PARALLEL MACHINE SCHEDULINGDAR EL EM; KARNI R.1980; OMEGA; GBR; DA. 1980; VOL. 8; NO 2; PP. 239-242; BIBL. 3 REF.Article

OBJECTIVE PERFORMANCE MEASUREMENT FOR CONSTRUCTION PROJECTSSIMMONS RT.1979; POWER ENGNG; USA; DA. 1979; VOL. 83; NO 9; PP. 53-55Article

ALGORITHMES D'OPTIMISATION DU NIVEAU DES OPERATIONSTATAR D.1976; AN. UNIV. GRAIOVA, 4; ROMAN.; DA. 1976; NO 4; PP. 49-52; ABS. ANGL.; BIBL. 3 REF.Article

UN NUOVO METODO DI PROGRAMMAZIONE NELLA PROGETTAZIONE. = UNE NOUVELLE METHODE D'ORDONNANCEMENT D'UN PROJETCIRILLO F.1975; RIC., MAT. PURE APPL.; ITAL.; DA. 1975-05; VOL. 26; PP. 25-36; ABS. ANGL.; BIBL. 4 REF.Article

A QUANTIZATION APPROXIMATION FOR MODELING COMPUTER NETWORK NODAL QUEUEING DELAYNIZNIK CA.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 245-253; BIBL. 42 REF.Article

ON 3 X N SEQUENCING PROBLEM INVOLVING EQUIVALENT-JOB FOR A JOB-BLOCK WITH TRANSPORTATION-TIMES OF JOBSMAGGU PL; GHANSHIAM DAS; MAHABIR SINGH et al.1981; MATH. OPERATIONSFORSCH. STAT., SER. OPTIM.; ISSN 0323-3898; DDR; DA. 1981; VOL. 12; NO 2; PP. 271-279; ABS. GER/RUS; BIBL. 12 REF.Article

SEQUENCING JOBS WITH UNEQUAL READY TIMES TO MINIMIZE MEAN FLOW TIMEDESSOUKY MI; DEOGUN JS.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 192-202; BIBL. 4 REF.Article

SPT, DATA ANALYSIS, AND A BIT OF COMMON SENSE IN BUS MAINTENANCE OPERATIONS: A CASE STUDYMARTIN VEGA LA.1981; AIIE TRANS.; ISSN 0569-5554; USA; DA. 1981; VOL. 13; NO 4; PP. 349-356; BIBL. 5 REF.Article

ON SINGLE-MACHINE SEQUENCING WITH ORDER CONSTRAINTSGLAZEBROOK KD.1980; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1980; VOL. 27; NO 1; PP. 123-130; BIBL. 5 REF.Article

REIHENFOLGEMODELLE MIT PARALLELITAET ZWISCHEN BEARBEITUNGSSTYLEN UND AUFTRAEGEN = MODELES D'ORDONNANCEMENT AVEC PARALLELITE ENTRE DEGRES DE FABRICATION ET COMMANDESSCHLUETER E.1979; WISS. Z. TECH. HOCHSCH. "OTTO VON GUERICKE"; ISSN 0541-8933; DDR; DA. 1979; VOL. 23; NO 6; PP. 631-632; BIBL. 5 REF.Article

RESOURCE SCHEDULING FOR PROJECT CONTROL.WILLIAMS GSK.1978; POWER ENGNG; U.S.A.; DA. 1978; VOL. 82; NO 4; PP. 66-69Article

ETUDE DE FAMILLES REMARQUABLES D'ORDONNANCEMENTS, EN VUE D'UNE AIDE A LA DECISION.RABAH DEMMOU.1977; ; S.L.; DA. 1977; PP. (261P.); BIBL. 2 P.; (THESE DOCT. ING., SPEC. AUTOM.; PAUL SABATIER TOULOUSE)Thesis

SEQUENCING N JOBS ON TWO MACHINES WITH SETUP, PROCESSING AND REMOVAL TIMES SEPARATEDSULE DR.1983; NAVAL RESEARCH LOGISTICS QUARTERLY; ISSN 0028-1441; USA; DA. 1983; VOL. 29; NO 3; PP. 517-519; BIBL. 2 REF.Article

  • Page / 92