The present study examined whether the central bottleneck, assumed to be primarily responsible for the psychological refractory period (PRP) effect, is intact, bypassed, or shifted in locus with ideomotor (IM)-compatible tasks. In 4 experiments, factorial combinations of IM- and non-IM-compatible tasks were used for Task 1 and Task 2. All experiments showed substantial PRP effects, with a stron...

Four experiments examined whether the psychological refractory period (PRP) effect can be eliminated with ideomotor compatible (IM) but not stimulus-response compatible (SR) tasks, as reported by A. G. Greenwald and H. G. Shulman (1973). Their tasks were used: a left or right movement to a left- or right-pointing arrow (IM) or to the word left or right (SR) for Task 1; saying "A" or "B" (IM) or...

In this paper we analyse the e ect of a cuto transaction size in a simple newsboy setting. It is assumed that customers with an order larger than a prespeci ed size are satis ed in an alternative way, against additional cost. For compound Poisson demand with discrete order sizes, we show how to determine the average cost and an optimal cuto transaction size. Because the computational e ort to c...

this article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. regarding the np-hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. a number of test problems are randomly generat...

nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. single row facility layout problem (srflp) is a np-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

In this paper, we consider a newsvendor who is going to invest on dedicated or flexible capacity, our goal is to find the optimal investment policy to maximize total profit while the newsvendor faces uncertainty in lead time and demand simultaneously. As highlighted in literature, demand is stochastic, while lead time is constant. However, in reality lead time uncertainty decreases newsvendor's...

despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...

In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...