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: The paper provides a theoretical background to solve a variety of single machine scheduling problems with quadratic separable functions of completion times including waiting time and due date models using a parametric ordering as well as an adjacent precedence matrix concept.

21 citations

Journal ArticleDOI
TL;DR: This work considers two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure and proposes a forward SPT-EDD heuristic that attempts to generate the set of non-dominated solutions.

21 citations

Journal ArticleDOI
TL;DR: A hybrid backward and forward dynamic programming algorithm is designed for the Lagrangian relaxed problem, which can deal with jobs with multiple immediate predecessors or successors as long as the underlying precedence graph representing the precedence relations between jobs does not contain cycles.

21 citations

Journal ArticleDOI
TL;DR: A criterion for optimality of two jobs to be scheduled next to each other is given, and based on this criterion a heuristic algorithm is proposed to solve the static single-facility scheduling problem.
Abstract: We consider the static single-facility scheduling problem where the processing times of jobs are a nondecreasing and differentiable function of their starting (waiting) times and the objective is to minimize the total elapsed time (makespan) in which all jobs complete their processing. We give a criterion for optimality of two jobs to be scheduled next to each other, and based on this criterion we propose a heuristic algorithm to solve the problem. The effectiveness of the algorithm is empirically evaluated for quadratic and exponential cost functions. In the quadratic case it is compared with the static heuristic algorithm proposed by Gupta and Gupta.

21 citations

Journal ArticleDOI
TL;DR: An investigation on the total weighted tardiness of the single machine scheduling problems by a heuristic procedure, namely backward forward heuristics.
Abstract: The urge to produce products in the production line at a faster rate with no compromise in quality has led to scheduling gaining greater importance in the modern day industries. Scheduling is concerned with the allocation of limited resources to tasks over time. The investigations on various scheduling problems have been of constant interest to researchers worldwide. This paper deals with an investigation on the total weighted tardiness of the single machine scheduling problems. The problems are solved by a heuristic procedure, namely backward forward heuristics. The different methods of formulating the problem instances are discussed. The benchmark problems and their best known values available in the OR library are used for the comparison to find out the influence of Relative Due Date (RDD) and Tardiness Factor (TF) used to generate the problem instances.

21 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