Interrupt handling is a tricky business in lazy functional languages: we have to make sure that thunks that are being evaluated can be halted and later restarted if and when they are required. This is a particular problem for implementations which use black-holing. Black-Holing deliberately makes it impossible to revert such thunks to their original state to avoid a serious space leak. Interact...

Research on non-regular performance measures is at best scarce in the deterministic machine scheduling literature with machine unavailability constraints. Moreover, almost all existing works in this area assume either that processing on jobs interrupted by an interval of machine unavailability may be resumed without any additional setup/processing or that all prior processing is lost. In this w...

This paper proposes a unified syntax for stackless and stackful coroutines. The syntax is based on N4397.3 The most important features are: • first-class object that can be stored in variables or containers • introduction of new keyword resumable together with a lambda-like expression • symmetric transfer of execution control, e.g. suspend-by-call enables a richer set of control flows than asym...

The paper considers makespan minimization on a single machine subject to release dates in the relocation problem, originated from a resource-constrained redevelopment project in Boston. Any job consumes a certain amount of resource from a common pool at the start of its processing and returns to the pool another amount of resource at its completion. In this sense, the type of our resource const...

We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0–1 integer progra...

S) Summarized by Geoffrey Lefebvre Making Exception Handling Work Bruno Cabral and Paulo Marques, University of Coimbra, Portugal Presented by Bruno Cabrel Exceptions are the standard mechanism for error handling in modern programming languages. Unfortunately, dealing with exceptions is a tedious process. Programmers often avoid the issue by writing empty handlers to save time. Programmers who ...

In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...

A primary goal of research into orthogonal persistence is to simplify significantly the construction, maintenance and operation of applications in order to save software costs, extend the range of applications and improve users’ experiences. To test such claims we need relevant experiments. To mount such experiments requires an industrial-strength persistent programming platform. The PJama proj...

We investigate a single machine scheduling problem with a fixed unavailability interval on machine and rejection job. The objective is to minimize the sum of the flow-time of the accepted jobs and penalties of rejected jobs. For the demonstrated NP-hard problem, we first propose a dynamic programming algorithm for solving small scale problem optimally. Further we propose an approximation algori...

A Pareto-optimal solution is developed in this paper for a scheduling problem on a single machine with periodic maintenance and non-preemptive jobs. Most of the scheduling problems address only one objective function, while in the real world, such problems are always associated with more than one objective. In this paper, both multi-objective functions and multi-maintenance periods are consider...