Journal ArticleDOI
A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
Suresh Chand,Hans Schneeberger +1 more
Reads0
Chats0
TLDR
In this paper, the Smith-heuristic is used for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tradiness for any job does not exceed a predefined maximum allowable tardiness.Abstract:
This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tradiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of this problem for which the Smith-heuristic is guaranteed to lead to optimal solutions. We also provide a worst-case analysis of the Smith-heuristic; the analysis shows that the fractional increase in the objective function value for the Smith-heuristic from the optimal solution is unbounded in the worst case.read more
Citations
More filters
Journal ArticleDOI
Multiple and bicriteria scheduling : A literature survey
TL;DR: A detailed literature survey of multiple and bicriteria problems in scheduling can be found in this article, where the authors provide a broad classification scheme for scheduling problems and discuss the trade-offs involved in considering several different criteria.
Journal ArticleDOI
Genetic algorithms for the two-stage bicriteria flowshop problem
TL;DR: Two Genetic Algorithms (GA) based approaches are proposed to solve the two-stage bicriteria flow shop scheduling problem with the objective of minimizing the total flow time subject to obtaining the optimal makespan.
Journal ArticleDOI
Bicriterion static scheduling research for a single machine
P Dileepan,T Sen +1 more
TL;DR: A critical review of the single machine static scheduling problem with two criteria jointly with a joint objective function where both criteria are included is presented.
Journal ArticleDOI
Two-Stage Flowshop Scheduling Problem with Bicriteria
TL;DR: The two-stage flowshop scheduling problem with the objective of minimizing total flowtime subject to obtaining the optimal makespan is discussed and a branch-and-bound algorithm and two heuristic algorithms have been developed.
Journal ArticleDOI
Multicriteria scheduling problems: a survey
TL;DR: A state-of-the-art survey on multicriteria scheduling is presented and an extension to an existing notation for scheduling problems is proposed for multicritia scheduling problems, which provides a framework that allows to tackle multicritical scheduling problems according to Decision Aid concepts.
References
More filters
Book ChapterDOI
Complexity of machine scheduling problems
TL;DR: In this paper, the authors survey and extend the results on the complexity of machine scheduling problems and give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity.
Journal ArticleDOI
A note on the extension of a result on scheduling with secondary criteria
TL;DR: In this paper, a result of Smith previously published in this journal, on the use of secondary criterion in scheduling problems is extended, and an example is presented, where the secondary criterion can be used for scheduling problems.
Journal ArticleDOI
Scheduling to minimize the weighted sum of completion times with secondary criteria
TL;DR: A new algorithm is given that converges to a local optimum for both problems and is shown to be incorrect and a counter example is presented.