Some results of the worst-case analysis for flow shop scheduling with a learning effect

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

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2013-12, Vol.211 (1), p.481-490
Main Authors: Sun, Lin-Hui, Cui, Kai, Chen, Ju-Hong, Wang, Jun, He, Xian-Chen
Format: Article
Language:English
Subjects:
Algorithms
Business and Management
Combinatorics
Completion time
Heuristic
Job shops
Knowledge management
Operations research
Operations Research/Decision Theory
Pallets
Production scheduling
Schedules
Scheduling
Studies
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-013-1368-6