113 research outputs found

    Real-Time Sensor Networks and Systems for the Industrial IoT: What Next?

    Get PDF
    The Industrial Internet of Things (Industrial IoT—IIoT) is the emerging core backbone construct for the various cyber-physical systems constituting one of the principal dimensions of the 4th Industrial Revolution [...

    Genetic Algorithm to Evolve Ensembles of Rules for On-Line Scheduling on Single Machine with Variable Capacity

    Get PDF
    International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC (8th . 2019. Almería, Spain

    Quality improvement through product redesign and the learning curve

    No full text
    This paper presents a dynamic programming model for studying the effects of product redesign on the value, cost, and quality control processes in a single product environment. The model provides the optimal redesign policy, that is the optimal depth and the optimal timing for implementing the redesign, so the accumulated net product value can be maximized. The accumulated net product value is used as a measure of product quality, however the model formulation allows for the use of other quality functions as well. The model can be used with different sets of learning rates and cost data. It can be also used with non-uniform learning rates among the different processes, and non-uniform redesign effects on the value, cost, and quality control learning curves. Selective results demonstrate that the early implementation of the optimal redesign level enhances the accumulated net product value.learning curve dynamic programming quality improvement product redesign

    Polynomially solvable total tardiness problems: Review and extensions

    No full text
    This paper shows that all polynomially solvable cases of the single machine total tardiness problem center around or are direct extensions of three well known results for that problem. A new polynomially solvable case for the problem is developed as well. It is also shown that two of these well known results for the single machine total tardiness problem are valid for the parallel machine total tardiness problem as well.scheduling single machine parallel machines tardiness polynomial solutions

    A note on minimizing the sum of quadratic completion times on twoidentical parallel machines

    No full text
    We consider the problem of minimizing the sum of quadratic completion times on two parallel machines and we discuss the approximation ratio of the generalized shortest processing time (GSPT) priority rule according to which the jobs are sorted in nondecreasing processing time order and the next job on the list is assigned to the earliest available machine. We show that the approximation ratio of the GSPT rule is bounded above by approx. 1.309 and below by approx. 1.290. Extensions to the parallel m-machine problem are also discusse

    A survey of simulated annealing applications to operations research problems

    No full text
    This paper surveys the application of simulated annealing (SA) to operations research (OR) problems. It is concluded that SA has been applied to both traditional (like single machine, flowshop and jobshop scheduling, lot sizing, traveling salesman problems) and non-traditional (like graph coloring, number partitioning) OR areas. It is also concluded that SA is quite appropriate when the alternative solution method is based on enumeration. SA usually requires more computational resources in exchange for not being trapped in local optima.simulated annealing scheduling QAP TSP routing facility layout lot sizing
    • …
    corecore