✦ LIBER ✦

Heuristic algorithms for continuous flow-shop problem

✍ Scribed by Chandrasekharan Rajendran; Dipak Chaudhuri

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 497 KB
Volume: 37
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199010)37:5<695::aid-nav3220370508>3.0.co;2-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics for minimizing total weighted

Heuristics for minimizing total weighted tardiness in flexible flow shops

✍ Ya Yang; Stephan Kreipl; Michael Pinedo 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 156 KB

Consider a #exible #ow shop with s stages in series and at each stage a number of identical machines in parallel. There are n jobs to be processed and each job has to go through the stages following the same route. Job j has release date r H , due date d H , weight w H and a processing time p HJ at

A flow-aligning algorithm for convection

A flow-aligning algorithm for convection-dominated problems

✍ Traian Iliescu 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 1 views

This paper proposes and studies an algorithm for aligning a triangulation with a given convection ÿeld. Approximate solutions of convection-dominated problems on ow-aligned meshes typically have sharper internal layers, less over and undershooting and higher accuracy. The algorithm we present can be

A tabu-search-based algorithm for contin

A tabu-search-based algorithm for continuous multiminima problems

✍ Francesco Franzè; Nicolò Speciale 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 2 views

An exact algorithm for the batch sequenc

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.

A Riccati-equation-based algorithm for c

A Riccati-equation-based algorithm for continuous-time optimal control problems

✍ Joe Imae 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB 👁 2 views

In this paper we consider continuous-time unconstrained optimal control problems. We propose a computational method which is essentially based on the closed-loop solutions of the linear quadratic optimal control problems. In the proposed algorithm, Riccati differential equations play an important ro

Asymptotically optimal linear time algor

Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views