8,872 research outputs found
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order
The paper considers a three-machine shop scheduling problem to minimize the makespan, in which the route of a job should be feasible with respect to a machine precedence digraph with three nodes and one arc. For this NP-hard problem that is related to the classical flow shop and open shop models, we present a simple 1.5-approximation algorithm and an improved 1.4-approximation algorithm
04231 Abstracts Collection -- Scheduling in Computer and Manufacturing Systems
During 31.05.-04.06.04, the Dagstuhl Seminar 04231 "Scheduling in Computer and Manufacturing Systems" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available
Clips: a capacity and lead time integrated procedure for scheduling.
We propose a general procedure to address real life job shop scheduling problems. The shop typically produces a variety of products, each with its own arrival stream, its own route through the shop and a given customer due date. The procedure first determines the manufacturing lot sizes for each product. The objective is to minimize the expected lead time and therefore we model the production environment as a queueing network. Given these lead times, release dates are set dynamically. This in turn creates a time window for every manufacturing order in which the various operations have to be sequenced. The sequencing logic is based on a Extended Shifting Bottleneck Procedure. These three major decisions are next incorporated into a four phase hierarchical operational implementation scheme. A small numerical example is used to illustrate the methodology. The final objective however is to develop a procedure that is useful for large, real life shops. We therefore report on a real life application.Model; Models; Applications; Product; Scheduling;
- …