We present a detailed analysis of the patient and resource scheduling problem in rehabilitation hospitals. In practice, the predominantly therapeutical treatments and activities which are prescribed for the patients are typically scheduled manually. This leads to rigid and inefficient schedules...

In a recent paper, Fisher et al. (2001) present a method tomitigate end-effects in lot sizing by including a valuation term for end-of-horizon inventory in the objective function of the short-horizon model. Computational tests show that the proposed method outperforms the Wagner-Whitin algorithm...

This paper calls for a change in paradigm in lot sizing and scheduling. Traditionally, a discrete time scale is chosen to model lot sizing and scheduling. As an alternative, the so-called block planning concept is proposed which is based on a continuous representation of time. A mixed-integer...

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

Scheduling methods are proposed for a class of flexible manufacturing systems consisting of machine centers served by a cyclic conveyor. The minimization of finish time is considered as the optimization criterion. An optimal algorithm is proposed for the minimum conveyor speed (S = 1) for a...

This paper presents an asymptotic analysis of hierarchical production planning in a manufacturing system with two tandem machines that are subject to breakdown and repair. Since the number of parts in the buffer between the two machines needs to be non-negative, the problem is inherently a state...

The optimal production control problem of deterministic pull flow lines with multiple part types is considered in this paper. The last machine is assumed to be the bottleneck. The objective is to minimize the total inventory and backlog costs over time. We give an optimal production policy and...

Parallel machine structure is very common in modern production systems. Its performance sometimes has a decisive impact on the whole productivity. In this paper, we consider a parallel-machine scheduling problem where each machine is subject to periodic maintenance. Instead of assuming all the...

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

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