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...

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...

A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of...

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...

We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing first to a machine called the primary machine, then to a number of other machines in a fixed sequence, and finally back to the primary machine for its last operation. The problem is to schedule...

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...

Flow shop scheduling is common in modern lean production systems. In practice, jobs in flow shops can arrive at irregular times. However, scheduling that considers such irregularity has not been adequately investigated in the literature. In this paper, we examine the scheduling of n-jobs in an...

We consider the reorder point, order quantity inventory model where the demand, D, and the lead time, L, are independently and identically distributed (iid) randiom variables. This model is analytically intractable because of order crossover. However, we show how to resolve the intractability by...

A supplier provides several lead-time options to its customers in a periodic review inventory system. The replenishment lead time is a multiple of the inventory review cycle. Customers are classified into two groups: short lead-time customers requiring the product immediately and long lead-time...

We propose a model where customers are classified into two groups: short lead-time customers who require the product immediately and long lead-time customers to whom the supplier may deliver either immediately or in the next cycle. Unmet orders are backlogged with associated costs. Specifically,...