Some results of the worst-case analysis for flow shop scheduling with a learning effect
| Autor: | Ju-Hong Chen, Kai Cui, Lin-Hui Sun, Jun Wang, Xian-Chen He |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Rate-monotonic scheduling
Mathematical optimization Single-machine scheduling Job shop scheduling Operations research Heuristic Computer science General Decision Sciences Dynamic priority scheduling Flow shop scheduling Management Science and Operations Research Round-robin scheduling Fair-share scheduling Learning effect Scheduling (computing) Heuristics Computer Science::Operating Systems |
| Zdroj: | Annals of Operations Research. 211:481-490 |
| ISSN: | 1572-9338 0254-5330 |
| Popis: | This article considers flow shop scheduling problems with a learning effect. By the learning effect, we mean that the processing time of a job is defined by a function of its position in a processing permutation. The objective is to minimize the total weighted completion time. Some heuristic algorithms by using the optimal permutations for the corresponding single machine scheduling problems are presented, and the worst-case bound of these heuristics are also analyzed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|