scispace - formally typeset
Search or ask a question
Topic

Single-machine scheduling

About: Single-machine scheduling is a research topic. Over the lifetime, 2473 publications have been published within this topic receiving 56288 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: 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.
Abstract: 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.

26 citations

Journal ArticleDOI
TL;DR: In this paper, a mathematical model has been formulated to minimize makespan (C max). Afterwards, genetic and tabu search algorithms have been developed, and some methods have been applied to genetic algorithm in order to maintain population diversity.
Abstract: This paper tackles the single-machine scheduling problem in which there are sequence-dependent setup times and deteriorating jobs. In this regard, a mathematical model has been formulated to minimize makespan (C max). Afterwards, genetic and tabu search algorithms have been developed. Since the population diversity is a very important issue in preventing neighborhood search from trapping in a local optimum, some methods have been applied to genetic algorithm in order to maintain population diversity, and the final results show the effectiveness of these methods. The calibration of genetic algorithm parameters and operators is performed using design of experiments. Finally, several examples are produced to illustrate the proposed approach.

26 citations

Journal ArticleDOI
TL;DR: This work considers scheduling models with positional deterioration or learning under precedence constraints that are built up iteratively from the prime partially ordered sets of a bounded width and shows that objective functions of the considered problems satisfy the job module property and possess the recursion property.

26 citations

Journal ArticleDOI
Jinxing Xie1
TL;DR: The single machine scheduling problem with multiple financial resource constraints can be reduced to the two machine flow shop scheduling problem if the financial resources arrive uniformly over time, and the LPT (Largest Processing Time) rule generates an optimal solution to the problem.

26 citations

Journal ArticleDOI
TL;DR: In this article, a single-machine scheduling model with a common due date was proposed to minimize the total cost including an identical, asymmetric earliness-tardiness cost.
Abstract: Costs of flowtime, earliness and tardiness should be incorporated in real production scheduling. This paper constructs a single-machine scheduling model with a common due date to minimize the total cost including an identical, asymmetric earliness-tardiness cost. Several dominance conditions necessary for an optimal schedule are derived. A branch and bound algorithm exploiting the conditions is proposed to find an optimal schedule for an unconstrained version of the scheduling problem. Numerical experiments are demonstrated to show the effectiveness of the proposed method.

26 citations


Network Information
Related Topics (5)
Supply chain management
39K papers, 1M citations
84% related
Supply chain
84.1K papers, 1.7M citations
82% related
Heuristics
32.1K papers, 956.5K citations
82% related
Scheduling (computing)
78.6K papers, 1.3M citations
81% related
Optimization problem
96.4K papers, 2.1M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202333
202270
202188
202083
201972
201889