This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenarios in which some proportion of the processing is repeated b...

This study investigates scheduling problems that occur when the weighted number of late jobs that are subject to deterministic machine availability constraints have to be minimized. These problems can be modeled as a more general job selection problem. Cases with resumable, non-resumable, and semi-resumable jobs as well as cases without availability constraints are investigated. The proposed ef...

In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: nonpreemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may ...

We study the problem of minimizing the weighted number of tardy jobs on a single machine with deterministic machine availability constraints. We show that the cases with resumable and non-resumable jobs (1, hk|ri, nr − a| ∑ wiUi and 1, hk|ri, r − a| ∑ wiUi) can both be modeled as a more general scheduling problem, consisting in selecting and scheduling jobs on parallel machines subject to time ...

We consider the following single-machine time-dependent scheduling problem with constraints on the machine availability. There is given a set of independent and deteriorating jobs Jj , 1 ≤ j ≤ n, to be processed on a single machine, starting from time t0 > 0. The processing time pj of job Jj is a proportional function of the starting time Sj of this job, pj = αjSj, where Sj ≥ t0 and deteriorati...

Teleportation is a quantum information processes without classical counterparts, in which the sender can disembodied transfer unknown states to receiver. In probabilistic teleportation through partial entangled channel, transmission exact (with fidelity 1), but may fail probability and initial state destroyed simultaneously. We propose scheme for nondestructive of high-dimensional states. With ...

Intelligent non-player characters that exhibit realistic ambient behaviors produce more captivating and immersive stories for the player. However, the creation of nonrepetitive and entertaining behaviors is challenging, since it involves writing complex custom scripting code for thousands of characters in a common game adventure. This demonstration describes the generation of motivational behav...

In this paper we study the problem of determining a production schedule for an order of n jobs on a single machine which is subject to stochastic machine failures. To avoid long downtime of the machine caused by unexpected failures, preventive maintenance should be planned as well. If a failure cannot be averted, a corrective maintenance activity is performed. Both maintenance activities are as...

Azure SQL Database and the upcoming release of SQL Server enhance Online Index Rebuild to provide fault-tolerance and allow index rebuild operations to resume after a system failure or a userinitiated pause. SQL Server is the first commercial DBMS to support pause and resume functionality for index rebuilds. This is achieved by splitting the operation into incremental units of work and persisti...