The encoding and representation of visually presented clock times was investigated in three experiments utilizing a comparative judgment task. Experiment 1 explored the effects of comparing times presented in different formats (clock face, digit, or word), and Experiment 2 examined angular distance effects created by varying positions of the hands on clock faces. In Experiment 3, encoding and p...

We consider several parallel machine scheduling settings with the objective to minimize the schedule makespan. The most general of these settings is unrelated parallel machine scheduling. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a scarce renewable resource. A given amount of that resource, e.g. workers, can be distributed...

The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. For a couple of problems of this type, recently the complexity status has...

Whereas the overwhelming majority of scheduling problems appears to be NP-hard, models with equal processing time jobs form a remarkable case which is still open for most problems but it intuitively looks polynomially solvable. The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time p. There are associated a release time rj...

Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the sizes of jobs. In this paper we address both, and study for the first time a scheduling problem that combines the classical unrelated machine scheduling model with stochastic processing times of jobs. By means of a novel time-indexed linear ...

This paper proposes an exact algorithm for the multicyclic schedules of hoist moves in a printed circuit board (PCB) electroplating facility, where exactly ( 1) parts enter and parts leave the production line during each cycle, and the processing time at each production stage is a given constant. The multicyclic scheduling problem is transformed into enumeration of intervals for linear function...

Recent studies have found that processing information according to an evolutionary relevant (i.e., survival) scenario improves its subsequent memorability, potentially as a result of fitness advantages gained in the ancestral past. So far, research has not revealed much about any proximate mechanisms that might underlie this so-called survival processing advantage in memory. Intriguingly, resea...

An excavator is a typical hydraulic heavy-duty human-operated machine used in general versatile construction operations, such as digging, ground levelling, carrying loads, dumping loads, and straight traction. However, there are many tasks, such as hazard environment (nuclear decomposition, earthquake, etc) which is not suitable human working on site. The remotely controllable excavators are re...

This paper presents a sensor fault detection and diagnosis approach for industrial combustion processes. Clustering algorithms are applied to the measurements of controllable process variables involved in single-input-single-output feedback control loops. Current data points from the process are compared with the clusters to identify sensor faults. Once the measurements of controllable process ...

Bachman and Janiak provided a sketch of the proof that the problem 1|ri,pi(v)1⁄4 ai/v|Cmax is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof. Journal of the Operational Research Society (2012) 63, 1018–1020. doi:10.1057/jors...