Katalog GES



Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness

Several heuristics are presented for the flowshop scheduling problem with the objective of minimizing mean tardiness. We consider the cases in which job sequences on all machines are the same (permutation flowshop) and in which they may be different. For the former case, the various methods that... Full description

1st Person: Kim, Yeong-Dae
Source: in Journal of the Operational Research Society Vol. 44, No. 1 (1993), p. 19-28
More Articles
Type of Publication: Article
Language: English
Published: 1993
Keywords: research-article
Heuristics
Scheduling
Sequencing
Online: Volltext
Volltext
  Search for full text
  • Be the first to leave a comment!

Similar Items

Cannot find similar records

Library Services

Search Options

Quick links

Orientation