An improved lower bound for a bi-criteria scheduling problemJIN YAN.Operations research letters. 2008, Vol 36, Num 1, pp 57-60, issn 0167-6377, 4 p.Article

Intelligent well technology can control oil reservoir inflow, auto-gaslift systemKONOPCZYNSKI, Michael R.Offshore (Conroe, Tex.). 2007, Vol 67, Num 1, issn 0030-0608, 60-63 [2 p.]Article

Batch scheduling with controllable setup and processing times to minimize total completion timeDANIEL NG, C. T; CHENG, T. C. E; KOVALYOV, M. Y et al.The Journal of the Operational Research Society. 2003, Vol 54, Num 5, pp 499-506, issn 0160-5682, 8 p.Article

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

A summary of periodic and random inspection policiesNAKAGAWA, T; MIZUTANI, S; CHEN, M et al.Reliability engineering & systems safety. 2010, Vol 95, Num 8, pp 906-911, issn 0951-8320, 6 p.Article

A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problemCHENG, T. C. E.Computers & operations research. 1990, Vol 17, Num 4, pp 425-426, issn 0305-0548, 2 p.Article

Complexity of preemptive minsum scheduling on unrelated parallel machinesSITTERS, René.Journal of algorithms (Print). 2005, Vol 57, Num 1, pp 37-48, issn 0196-6774, 12 p.Article

A note on spécial optimal batching structures to minimize total weighted completion timeWENHUA LI; JINJIANG YUAN; YIXUN LIN et al.Journal of combinatorial optimization. 2007, Vol 14, Num 4, pp 475-480, issn 1382-6905, 6 p.Article

Online scheduling on m uniform machines to minimize total (weighted) completion timeMING LIU; CHENGBIN CHU; YINFENG XU et al.Theoretical computer science. 2009, Vol 410, Num 38-40, pp 3875-3881, issn 0304-3975, 7 p.Article

Impact of prior abdominal or pelvic surgery on colonoscopy outcomesSANG KIL LEE; TAE IL KIM; SUNG JAE SHIN et al.Journal of clinical gastroenterology. 2006, Vol 40, Num 8, pp 711-716, issn 0192-0790, 6 p.Article

Single-machine group scheduling problems with deterioration considerationWU, Chin-Chia; SHIAU, Yau-Ren; LEE, Wen-Chiung et al.Computers & operations research. 2008, Vol 35, Num 5, pp 1652-1659, issn 0305-0548, 8 p.Article

'Delivering the limit' work-flow process advances industry's push for continuous performance improvement in well operationsRENSINK, W; GALLOWAY, G; BRINSDEN, M et al.Oil & gas journal. 2000, Vol 98, Num 10, pp 45-48, issn 0030-1388Article

Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequencesGAWIEJNOWICZ, Stanislaw; KURC, Wieslaw; PANKOWSKA, Lidia et al.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2150-2166, issn 0166-218X, 17 p.Conference Paper

Analysing completion times in an academic emergency department: coordination of care is the weakest linkVEGTING, I. L; NANAYAKKARA, P. W. B; VAN DONGEN, A. E et al.Netherlands journal of medicine. 2011, Vol 69, Num 9, pp 392-398, issn 0300-2977, 7 p.Article

Minimize formation damage by rapid, inexpensive method of completion- and stimulation-fluid selectionUNDERDOWN, D. R; CONWAY, M. W.SPE production engineering. 1992, Vol 7, Num 1, pp 56-60, issn 0885-9221Conference Paper

Single machine scheduling problem with controllable processing times and resource dependent release timesCHOI, Byung-Cheon; YOON, Suk-Hun; CHUNG, Sung-Jin et al.European journal of operational research. 2007, Vol 181, Num 2, pp 645-653, issn 0377-2217, 9 p.Article

A half-product based approximation scheme for agreeably weighted completion time variance : Logistics: From theory to applicationJINLIANG CHENG; KUBIAK, Wieslaw.European journal of operational research. 2005, Vol 162, Num 1, pp 45-54, issn 0377-2217, 10 p.Conference Paper

A new heuristic for open shop total completion time problemLIXIN TANG; DANYU BAI.Applied mathematical modelling. 2010, Vol 34, Num 3, pp 735-743, issn 0307-904X, 9 p.Article

A note on unrelated parallel machine scheduling with time-dependent processing timesKUO, W-H; HSU, C-J; YANG, D-L et al.The Journal of the Operational Research Society. 2009, Vol 60, Num 3, pp 431-434, issn 0160-5682, 4 p.Article

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

Step change improvement and high rate learning are delivered by targeting technical limits on sub-sea wellsBOND, D. F; SCOTT, P. W; PAGE, P. E et al.IADC/SPE drilling conference. 1996, pp 299-312Conference Paper

On the difference between polynomial-time many-one and truth-table reducibilities on distributional problemsAIDA, Shin; SCHULER, Rainer; TSUKIJI, Tatsuie et al.Lecture notes in computer science. 2001, pp 51-62, issn 0302-9743, isbn 3-540-41695-1Conference Paper

Immunity of complete problemsHOMER, S; JIE WANG.Information and computation (Print). 1994, Vol 110, Num 1, pp 119-129, issn 0890-5401Article

Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraintsYUMEI HUO; HAIRONG ZHAO.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1081-1091, issn 0304-3975, 11 p.Article

Exponential inapproximability and FPTAS for scheduling with availability constraintsBIN FU; YUMEI HUO; HAIRONG ZHAO et al.Theoretical computer science. 2009, Vol 410, Num 27-29, pp 2663-2674, issn 0304-3975, 12 p.Article