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

Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

โœ Scribed by Jinxing Xie; Xijun Wang

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
519 KB
Volume
50
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

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. @

๐Ÿ“œ 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

Heuristic algorithms for preemptive sche
Heuristic algorithms for preemptive scheduling in a two-stage hybrid flowshop with additional renewable resources at each stage
โœ Ewa Figielska ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 464 KB

This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and renewable resources at both the stages. The resource requirements are of a 0-1 type. The objective is the minimization of makespan. The problem is NP-hard. Four heuristic algorithm