𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect

✍ Scribed by Radosław Rudek

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
454 KB
Volume
61
Category
Article
ISSN
0360-8352

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

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

An efficient branch-and-bound algorithm
An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem
✍ Wei-Chang Yeh 📂 Article 📅 2001 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 826 KB

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-b

Exact and heuristic algorithms for paral
Exact and heuristic algorithms for parallel-machine scheduling with DeJong’s learning effect
✍ Dariusz Okołowski; Stanisław Gawiejnowicz 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 296 KB

## a b s t r a c t We consider a parallel-machine scheduling problem with a learning effect and the makespan objective. The impact of the learning effect on job processing times is modelled by the general DeJong's learning curve. For this NP-hard problem we propose two exact algorithms: a sequenti