𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Flowshop sequencing with non-permutation schedules

✍ Scribed by M. Tandon; P.T. Cummings; M.D. LeVan

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
680 KB
Volume
15
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 FPTAS for scheduling a two-machine fl
An FPTAS for scheduling a two-machine flowshop with one unavailability interval
✍ C.T. Ng; Mikhail Y. Kovalyov πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 87 KB

## Abstract We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. Th