We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last operation, and the number of...

A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number...

Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of review. Here we focus on a flexible job shop scheduling problem of minimizing the makespan in a two-center job shop, where the first center consists of one machine and the second...

We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...

This note is concerned with the optimality of an (s; S) policy for a single-item infinite-horizon inventory model when the penalty cost is made-up of two parts: A lump-sum cost independent of the amount of the shortage and a variable cost proportional to the amount of the shortage. Using a...

Business environments change over time. They are cyclic, show seasonality or just evolve over time. This is certainly true for customer demand. As a result, stationary demand distributions are crude approximations of true customer behavior at best. Yet, most classical stochastic inventory models...

This paper investigates the dynamic inventory model for the case when production in a period is restricted to a finite set of specified values. The model allows the production rate to be any value in the set (0, P, 2P, ..., mP), where m is a non-negative integer. It is assumed that the setup...

This paper proposes a new methodology to solve partially observed inventory problems. Generally, these problems have infinitedimensional states that are conditional distribution of the inventory level. Our methodology involves linearizing the state transitions via unnormalized probabilities. It...

This paper presents an asymptotic analysis of control models governed by stochastic ordinary differential equations. A sufficient condition of near-optimal controls is given based on Ekeland's principle. It is shown that, under some concavity assumptions, the e-maximum condition in terms of the...