Sixty-one lid-loading procedure, performed by the author, were evaluated prospectively. Simple, gold weight implantation, combined with lower lid retractor recession, placement of fascia lata, and lateral tarsal strip tightening is effective for promoting voluntary closure and correction of lower lid paralytic ectropion. Placement of a heavier gold weight, in combination with mullerectomy, is a...

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical N P-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a ...

We present an qpproximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm find,!; a packing of n rectangles whose total height is within a ,factor of (1 + E ) of optimal, and has running time polynomial both in n and in 1 / E . It is based on a reduction to fractional bin-packing, and ...

We investigate the best-fit heuristic algorithm by Burke et al. [Operations Research 52 (2004) 655–671] for the rectangular strip packing problem. For its simplicity and good performance, the best-fit heuristic has become one of the most significant algorithms for the rectangular strip packing. In this paper, we propose an efficient implementation of the best-fit heuristic that requires linear ...

We consider the online scheduling problem of parallel jobs on parallel machines, P |online − list,mj |Cmax. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7competitive algorithm for this problem. The presented algorithm also applies to the special case where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefor...

In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyperheuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators ...

Abstract We study the Non-preemptive Peak Demand Minimization (NPDM) problem, where we are given a set of jobs, specified by their processing times and energy requirements. The goal is to schedule all jobs within fixed time period such that peak load (the maximum total requirement at any time) minimized. This problem has recently received significant attention due its relevance in smart-grids. ...