๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A powerful solution algorithm for single-stage flash problems

โœ Scribed by M. Kinoshita; T. Takamatsu

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
667 KB
Volume
10
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A single-step algorithm for oscillatory
A single-step algorithm for oscillatory problems
โœ Thomas, R. M. ;Evans, S. J. ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 399 KB

We consider a class of multistage single-step methods introduced by Zienkicwicz ef al. ' and developed by Thomas and Gladwell.' From this class, we derive methods which are particularly suitable for the numerical solution of oscillatory problems. We propose a particular pair of methods which permit

A GA/TS algorithm for the stage shop sch
A GA/TS algorithm for the stage shop scheduling problem
โœ Mohammad Mahdi Nasiri; Farhad Kianfar ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 570 KB

This paper presents a special case of the general shop called stage shop problem. The stage shop is a more realistic generalization of the mixed shop problem. In the stage shop problem, each job has several stages of operations. In order to solve the stage shop problem with makespan objective functi

An experimental comparison of solution a
An experimental comparison of solution algorithms for the single-machine tardiness problem
โœ Kenneth R. Baker; James B. Martin ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 778 KB

## Abstract A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A nu