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

A two-machine flowshop sequencing problem with limited waiting time constraints

โœ Scribed by Dar-Li Yang; Maw-Sheng Chern

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
454 KB
Volume
28
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Heuristics for two-machine no-wait flows
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
โœ Guoqing Wang; T.C.Edwin Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 75 KB

In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a w

The -machine flowshop problem with unit-
The -machine flowshop problem with unit-time operations and intree precedence constraints
โœ Igor Averbakh; Oded Berman; Ilya Chernykh ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 163 KB

We consider the flowshop problem with unit-time operations and intree precedence constraints, with the objective to minimize the total completion time. We present a polynomial-time algorithm assuming that the number of machines is fixed. This proves a recently stated conjecture.

Flowshop sequencing problem with ordered
Flowshop sequencing problem with ordered processing time matrices: A general case
โœ M. L. Smith; S. S. Panwalkar; R. A. Dudek ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 305 KB

## Abstract The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper con

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.