Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Temps achèvement")

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


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

Author Country

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

Results 1 to 25 of 732

  • Page / 30

Selection :

  • and

An algorithm for the N/M/paralel/Cmax preemptive due-date scheduling problemCHENG, T. C. E; SIN, C. C. S.Engineering costs and production economics. 1991, Vol 21, Num 1, pp 43-49, issn 0167-188XArticle

Proof of a conjecture of Schrage about the completion time variance problemHALL, N. G; KUBIAK, W.Operations research letters. 1991, Vol 10, Num 8, pp 467-472, issn 0167-6377Article

Experimental AlgorithmsBATTITI, R; BERTOSSI, A.Algorithmica. 2002, Vol 33, Num 1, issn 0178-4617, 128 p.Serial Issue

Optimal comment due-date withlimited completion timeDICKMAN, B; WILAMOWSKY, Y; EPSTEIN, S et al.Computers & operations research. 1991, Vol 18, Num 1, pp 125-127, issn 0305-0548Article

A note on Schedule of n jobs on two identical machines to minimize weighted mean flow timeWEBSTER, S.Computers & industrial engineering. 1994, Vol 26, Num 4, pp 795-796, issn 0360-8352Article

Parkinson's law and its implications for project managementGUTIERREZ, G. J; KOUVELIS, P.Management science. 1991, Vol 37, Num 8, pp 990-1001, issn 0025-1909Article

Bounding the minimal completion time of static mappings of multithreaded solaris programsLUNDBERG, L.Lecture notes in computer science. 1997, pp 1034-1038, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Permutation schedules for flow shops with precedence constraintsEWACHA, K; RIVAL, I; STEINER, G et al.Operations research. 1990, Vol 38, Num 6, pp 1135-1139, issn 0030-364XArticle

RESOURCE OPTIMIZATION OF CONSTRUCTION OPERATIONS USING AOA-BASED SIMULATIONZANELDIN, E. K.International journal of simulation modelling. 2008, Vol 7, Num 3, pp 146-157, issn 1726-4529, 12 p.Article

Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA POUTRE, Han.Lecture notes in computer science. 2002, pp 872-883, issn 0302-9743, isbn 3-540-44180-8, 12 p.Conference Paper

A class of single machine central tendency-dispersion bicriteria problemsMITTENTHAL, J; RAGHAVACHARI, M; RANA, A et al.The Journal of the Operational Research Society. 1996, Vol 47, Num 11, pp 1355-1365, issn 0160-5682Article

Deterministic multiprocessor scheduling with multiple objectivesEPSTEIN, S; WILAMOWSKY, Y; DICKMAN, B et al.Computers & operations research. 1992, Vol 19, Num 8, pp 743-749, issn 0305-0548Article

Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effectKUO, Wen-Hung; YANG, Dar-Li.European journal of operational research. 2006, Vol 174, Num 2, pp 1184-1190, issn 0377-2217, 7 p.Article

A new completion time algorithm considering an out-of-phase policy in batch processesRYU, J.-H; LEE, I.-B.Industrial & engineering chemistry research. 1997, Vol 36, Num 12, pp 5321-5328, issn 0888-5885Article

List scheduling revisitedSCHUTTEN, J. M. J.Operations research letters. 1996, Vol 18, Num 4, pp 167-170, issn 0167-6377Article

Parallel-machine batching and scheduling to minimize total completion timeCHENG, T. C. E; CHEN, Z.-L; KOVALYOV, M. Y et al.IIE transactions. 1996, Vol 28, Num 11, pp 953-956, issn 0740-817XArticle

Scheduling unit-time open shops with deadlinesTAUTENHAHN, T.Operations research. 1994, Vol 42, Num 1, pp 189-192, issn 0030-364XArticle

A bayesian sequential single machine scheduling problem to minimize the expected weighted sum of flowtimes of jobs with exponential processing timesHAMADA, T; GLAZEBROOK, K. D.Operations research. 1993, Vol 41, Num 5, pp 924-934, issn 0030-364XArticle

Single-machine scheduling subject to stochastic breakdownsBIRGE, J; FRENK, J. B. G; MITTENTHAL, J et al.Naval research logistics. 1990, Vol 37, Num 5, pp 661-667, issn 0894-069XArticle

Preemptive multiprocessor task scheduling to minimize the sum of completion timesMALAFIEJSKI, Michal; KUSZNER, Lukasz; PIWAKOWSKI, Konrad et al.ACS'2002 : advanced computer systems. International multi conference. 2002, isbn 83-87362-46-8, 2Vol, Part 1, 189-196Conference Paper

The permutahedron of N-sparse posetsVON ARNIM, A; SCHRADER, R; WANG, Y et al.Mathematical programming. 1996, Vol 75, Num 1, pp 1-18, issn 0025-5610Article

Batching and scheduling in FMS hubs : flow time considerationsLANE, D. E; SIDNEY, J. B.Operations research. 1993, Vol 41, Num 6, pp 1091-1103, issn 0030-364XArticle

A heuristic solution procedure to minimize makespan on a single machine with non-linear cost functionsBAHRAM ALIDAEE.The Journal of the Operational Research Society. 1990, Vol 41, Num 11, pp 1065-1068, issn 0160-5682Article

Parametric precedence relations in single machine schedulingSZWARC, W.Operations research letters. 1990, Vol 9, Num 2, pp 133-140, issn 0167-6377, 8 p.Article

Job lateness in flowshops with setup and removal times separatedALLAHVERDI, A; ALDOWAISAN, T.The Journal of the Operational Research Society. 1998, Vol 49, Num 9, pp 1001-1006, issn 0160-5682Article

  • Page / 30