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

A heuristic algorithm for two-stage flexible flow shop scheduling with head group constraint

โœ Scribed by Li, Zhan-tao; Chen, Qing-xin; Mao, Ning

Book ID
121277164
Publisher
Taylor and Francis Group
Year
2013
Tongue
English
Weight
553 KB
Volume
51
Category
Article
ISSN
0020-7543

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Complexity and algorithms for two-stage
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
โœ Jinxing Xie; Xijun Wang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 519 KB

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem