A heuristic solution concept for a generalized machine sequencing problem with an application to radiator manufacturing

@article{Zpfel2000AHS,
  title={A heuristic solution concept for a generalized machine sequencing problem with an application to radiator manufacturing},
  author={G{\"u}nther Z{\"a}pfel and Michael Wasner},
  journal={International Journal of Production Economics},
  year={2000},
  volume={68},
  pages={199-213}
}
  • G. ZäpfelM. Wasner
  • Published 20 November 2000
  • Business
  • International Journal of Production Economics
7 Citations

Figures and Tables from this paper

Integration between flow scheduling and personnel allocation in a parallel line system in automotive industry

An extended mathematical model for flow shop scheduling with parallel lines and simultaneously a worker assignment to machines as well as a solution concept for practical use is developed.

Modelling in product and supply chain design: literature survey and case study

This paper presents a framework for supply chain decision‐making. The framework is used to gain insights into applications of modelling. Current modelling practice is reviewed through a literature

Konzept für die Feinterminierung eines JiT-Zulieferers, gezeigt an einem Praxisfall aus der Automobilindustrie

In der Zulieferindustrie nimmt Just-in-Time (JiT) eine immer bedeutendere Rolle ein. Es werden dabei langerfristige Rahmenvertrage geschlossen, die u.a. Aussagen uber geplante Abnahmemengen des

Entwicklung eines Entscheidungsunterstützungssystems für die Planung von Schnittstellentests im Rahmen der Qualitätssicherung von komponentenbasierter Unternehmenssoftware

Bei der Erstellung von komponentenbasierter Unternehmenssoftware ist es eine Aufgabe der Qualitatssicherung sicherzustellen, dass die Schnittstellen zwischen den einzelnen Komponenten keine Fehler

Konzeption und Implementierung eines Planungssystems für Schnittstellentests

Das Planungssystem berucksichtigt sowohl unterschiedliche Planungsziele, als auch relevante Problemrestriktionen durch eine geeignete Wahl der Problemkodierung, einer geschickten Erzeugung des Zeitplans aus der problemkodIERung sowie einer einzelnen Initialisierung.

References

SHOWING 1-10 OF 19 REFERENCES

Job shop scheduling with alternative machines

An efficient algorithm based on the SPT rule is developed to solve the problem of minimizing the mean flow time in a general job shop type machining system with alternative machine tool routeings by decomposing it into subproblems that are easier to solve.

New search spaces for sequencing problems with application to job shop scheduling

In this paper search heuristics are developed for generic sequencing problems with emphasis on job shop scheduling. The proposed methods integrate problem specific heuristics common to Operations

Job-shop scheduling: limits of the binary disjunctive formulation

It is shown that the underlying binary-disjunctive formulation itself is more robust than might be immediately apparent, and straightforward extensions of the underlying model are sufficient to capture such practical problem features as assembly and disassembly sequences, due-dates and out-processing operations, scheduled maintenance, nonzero release times and dispatch operations, and a great range of operational side-constraints.

Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling

The development and the main results of classical scheduling theory are reviewed and presented in an easily accessible way and the need for an integrated scheduling research effort, containing elements of both approaches, is stressed.

A Computational Study of the Job-Shop Scheduling Problem

The optimization procedure, combining the heuristic method and the combinatorial branch and bound algorithm, solved the well-known 10×10 problem of J. F. Thomson in under 7 minutes of computation time on a Sun Sparcstation 1.

Lot Streaming in Job-Shop Scheduling

A model and an iterative procedure for a general job-shop environment that validates the capacitated lot-sizing models in which the detailed capacity constraints are ignored and approaches a lower bound using very few sublots.

Algorithms for Solving Production-Scheduling Problems

It is shown that it is practical, in problems of small size, to generate the complete set of all active schedules and to pick the optimal schedules directly from this set and, when this is not practical, to random sample from the bet of allactive schedules.

An algorithm for solving the job-shop problem

In this paper, we propose a branch and bound method for solving the job-shop problem. It is based on one-machine scheduling problems and is made more efficient by several propositions which limit the

Tabu search for the job-shop scheduling problem with multi-purpose machines

It is shown that an application of tabu search techniques to this problem yields excellent results for benchmark problems and to the hardest problems in combinatorial optimization.