Results 1 - 10 of 19

Single-Machine Scheduling with Aging Effects and Optional Maintenance Activity Considerations

by Chou-Jung Hsu
"... This paper explores a single-machine scheduling with aging effects and the problem regarding optional maintenance activity assignment. The jobs' processing time is assumed to follow a power position-dependent aging model. The optional maintenance activity refers to the situation in which the m ..."
Abstract - Add to MetaCart
the maintenance activity can be scheduled immediately after processing of any job has been completed except for the last job and the duration of maintenance activity can be of any value from zero to a fixed time interval. A recovery function is proposed to reflect the efficiency of the machine or worker which

MPM Job-shop under Availability Constraints

by N. Zribi, A. El Kamel, Nozha Zribi, École Centrale De Lille
"... Abstract: A large part of scheduling literature assumes that machines are avail-able all the time. In this paper, the MPM Job-shop scheduling problem, where the machine maintenance has to be performed within certain time intervals inducing ma-chine unavailability, is studied. Two approaches to solve ..."
Abstract - Add to MetaCart
Abstract: A large part of scheduling literature assumes that machines are avail-able all the time. In this paper, the MPM Job-shop scheduling problem, where the machine maintenance has to be performed within certain time intervals inducing ma-chine unavailability, is studied. Two approaches

A Polynomial Algorithm for Special Case of the One-Machine Scheduling Problem with Time-Lags

by Helena Ramalhinho-lourenço
"... The standard one-machine scheduling problem consists in scheduling a set of jobs in one machine which can handle only one job at a time, minimizing the maximum lateness. Each job is available for processing at its release date, requires a known processing time and after finishing the processing, it ..."
Abstract - Add to MetaCart
The standard one-machine scheduling problem consists in scheduling a set of jobs in one machine which can handle only one job at a time, minimizing the maximum lateness. Each job is available for processing at its release date, requires a known processing time and after finishing the processing

AN ALGEBRAIC MAX-PLUS MODEL FOR HVLV SYSTEMS SCHEDULING AND OPTIMIZATION WITH REPETITIVE AND FLEXIBLE PERIODIC PREVENTIVE MAINTENANCE: JUST-IN-TIME PRODUCTION

by Imed Nasri, Georges Habchi, Reda Boukezzoula
"... ABSTRACT: Most production scheduling problems, including High-Variety, Low-Volume (HVLV) scheduling problems assume that machines are continuously available. However, in most actual situations, machines become unavailable during certain periods when preventive maintenance (PM) is scheduled. In this ..."
Abstract - Add to MetaCart
tasks are periodically scheduled: maintenance is required after a periodic time (all periods are equals on each machine). Second, time intervals between two consecutive maintenance activities are not equals (flexible periodic maintenance). However, time intervals are known in advance. Consequently

Saskatoon By

by Dmytro Dyachuk
"... In presenting this thesis in partial fulfilment of the requirements for a Postgraduate degree ..."
Abstract - Add to MetaCart
In presenting this thesis in partial fulfilment of the requirements for a Postgraduate degree

The Datacenter as a Computer An Introduction to the Design of Warehouse-Scale Machinesiii Synthesis Lectures on Computer Architecture Editor

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found

The Datacenter as a Computer An Introduction to the Design of Warehouse-Scale Machinesiii Synthesis Lectures on Computer Architecture Editor

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found

The Datacenter as a Computer An Introduction to the Design of Warehouse-Scale Machinesiii Synthesis Lectures on Computer Architecture Editor

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found

of a due window assignment

by A. Janiak, W. A. Janiak, M. Marek
"... Abstract. In the paper we investigate four single processor scheduling problems, which deal with the process of the negotiation between a producer and a customer about delivery time of final products. This process is modeled by a due window, which is a generalization of well known classical due date ..."
Abstract - Add to MetaCart
Abstract. In the paper we investigate four single processor scheduling problems, which deal with the process of the negotiation between a producer and a customer about delivery time of final products. This process is modeled by a due window, which is a generalization of well known classical due

1 Acknowledgements

by Entwurf Entwicklung, Sensornetz-testbeds Wald-monitoring, Masterarbeit Von Iliya Gurov, Vorgelegte Masterarbeit, Iliya Gurov, Gutachter Prof Alej, Ro Buchmann, Tag Der Einreichung, Ehrenwörtliche Erklärung Zur Masterarbeit, I Mr, Pablo Guerrero, Prof Alej, Ro Buchmann , 2013
"... den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehörde vorgelegen. Darmstadt, den 15.01.2013 ..."
Abstract - Add to MetaCart
den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehörde vorgelegen. Darmstadt, den 15.01.2013
Results 1 - 10 of 19