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 proposed problem is shown to be NP-hard, a heuristic algorithm with computational experiments is provided and an extension with more than one maintenance intervals is considered.
Abstract: This paper considers a single machine scheduling problem with a flexible maintenance, we consider the machine should be stopped to maintain or to reset for a constant time r during the scheduling period. Meanwhile we assume that the maintenance period [s, t] is arranged previously; and the time r would not be longer than the maintenance period [s, t] (i.e. r ≤ t-s). The time s (t) is the earliest (latest) time at which the machine starts (stops) its maintenance. The objective is to minimize the makespan (maximum completion time). This scheduling problem is often occurred in computer center, NC-machine and IC-testing machine for the jobs scheduling and repairmen arrangement. In this paper, the proposed problem is shown to be NP-hard. A heuristic algorithm with computational experiments is provided. An extension with more than one maintenance intervals is also considered.

52 citations

Journal ArticleDOI
TL;DR: A dynamic programming algorithm and it is shown that the single machine scheduling problem with a fixed non-availability interval has an FPTAS (Fully Polynomial Time Approximation Algorithm) by exploiting the well-known approach of Ibarra and Kim.
Abstract: In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval. We aim to minimize the makespan when every job has a positive tail. We propose a polynomial approximation algorithm with a worst-case performance ratio of 3/2 for this problem. We show that this bound is tight. We present a dynamic programming algorithm and we show that the problem has an FPTAS (Fully Polynomial Time Approximation Algorithm) by exploiting the well-known approach of Ibarra and Kim (J. ACM 22:463–468, 1975). Such an FPTAS is strongly polynomial. The obtained results outperform the previous polynomial approximation algorithms for this problem.

52 citations

Book ChapterDOI
30 Dec 2013
TL;DR: This work proposes a new approach for solving sequencing problems based on multivalued decision diagrams (MDDs), which are compact graphical representations of Boolean functions, originally introduced for applications in circuit design by Lee and widely studied and applied in computer science.
Abstract: Sequencing problems are among the most widely studied problems in operations research. Specific variations of sequencing problems include single machine scheduling, the traveling salesman problem with time windows, and precedence-constrained machine scheduling. In this work we propose a new approach for solving sequencing problems based on multivalued decision diagrams (MDDs). Decision diagrams are compact graphical representations of Boolean functions, originally introduced for applications in circuit design by Lee [7], and widely studied and applied in computer science. They have been recently used to represent the feasible set of discrete optimization problems, as demonstrated in [2] and [3, 4]. This is done by perceiving the constraints of a problem as a Boolean function f(x) representing whether a solution x is feasible. Nonetheless, such MDDs can grow exponentially large, which makes any practical computation prohibitive in general.

52 citations

Journal ArticleDOI
TL;DR: An efficient exact algorithm for the general single-machine scheduling problem where machine idle time is permitted that outperforms existing exact algorithms and can solve instances of the first three problems with up to 200 jobs and those of the last problem withup to 80 jobs.
Abstract: This paper proposes an efficient exact algorithm for the general single-machine scheduling problem where machine idle time is permitted. The algorithm is an extension of the authors' previous algorithm for the problem without machine idle time, which is based on the SSDP (Successive Sublimation Dynamic Programming) method. We first extend our previous algorithm to the problem with machine idle time and next propose several improvements. Then, the proposed algorithm is applied to four types of single-machine scheduling problems: the total weighted earliness-tardiness problem with equal (zero) release dates, that with distinct release dates, the total weighted completion time problem with distinct release dates, and the total weighted tardiness problem with distinct release dates. Computational experiments demonstrate that our algorithm outperforms existing exact algorithms and can solve instances of the first three problems with up to 200 jobs and those of the last problem with up to 80 jobs.

52 citations

Journal ArticleDOI
TL;DR: This work proposes a polynomial algorithm assuming that all processing times and all due dates are fuzzy numbers of the L–R type with power shape functions and proves that the second problem is NP-hard.

52 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