𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems

✍ Scribed by Chia-Shin Chung; James Flynn; Ömer Kirca

Book ID
108116922
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
158 KB
Volume
174
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid algorithm for the one machine s
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
✍ V. Srinivasan 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio

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