𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Repetitive pure flowshop problem: A permutation approach

✍ Scribed by Reza Ramazani; Nazar Younis

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
348 KB
Volume
24
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A bicriteria two-machine permutation flo
A bicriteria two-machine permutation flowshop problem
✍ Funda Sivrikaya-Şerifoğlu; GΓΌndΓΌz Ulusoy πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 263 KB

The problem attacked in this paper is the scheduling of n jobs on two machines which are assumed to be continuously available. All jobs are available at the beginning of the scheduling period. Setup times are included in the processing times. No preemption of jobs is allowed. The objective is the mi

A branch-and-bound algorithm with fuzzy
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
✍ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 697 KB

This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi