This note deals with the problem of minimising the expected sum of quadratic holding and shortage inventory costs when a single, failure-prone machine produces multiple part-types. Shu and Perkins (2001) introduce the problem and, by restricting the set of control policies to the class of...

This paper is concerned with an asymptotic analysis of hierarchical production and setup scheduling in a stochastic manufacturing system consisting of a single failure-prone machine and facing constant demands for a number of products. At any given time the system can only produce one type of...

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. The system produces a single product, whose rate of demand over time is given to be constant. The problem is formulated as a...

Flexible transfer lines or mixed-model assembly lines are capable of diversified small-lot production due to negligible switch-over costs. With these lines, it is possible to implement just-in-time (JIT) production, which involves producing only the necessary parts in the necessary quantities at...

This paper is concerned with an asymptotic analysis of hierarchical production planning in a stochastic manufacturing system consisting of machines that are subject to breakdown and repair. The system produces a single product whose rate of demand over time is constant. The problem is formulated...

The purpose of solving scheduling problems is to find the optimal order of processing different tasks on a set of different processors while effectively utilizing the limited available resources. Effective schedules result not only in improved utilization of resources but also customer...

We consider an extension of classic parallel machine scheduling where a set of jobs is scheduled on identical parallel machines and an undirected conflict graph is part of the input. Each node in the graph represents a job and an edge implies that its two jobs are conflicting, meaning that they...

We consider the scheduling problem of minimizing the average weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive...

This paper considers a dairy industry problem on integrated planning and scheduling a Mixed Integer Linear Programming (MILP) formulation is introduced to integrate tactical and operational decisions with uncertain demand and a heuristic approach is proposed to decompose time buckets of the...