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: A branch-and-bound algorithm is proposed for a single-machine sequencing problem with both release dates and deadlines to minimize the total weighted completion time and a new algorithm is developed for the generalized isotonic regression problem.
Abstract: We study a single-machine sequencing problem with both release dates and deadlines to minimize the total weighted completion time. We propose a branch-and-bound algorithm for this problem. The algorithm exploits an effective lower bound and a dynamic programming dominance technique. As a byproduct of the lower bound, we have developed a new algorithm for the generalized isotonic regression problem; the algorithm can also be used as an O(nlogn)-time timetabling routine in earliness-tardiness scheduling. Extensive computational experiments indicate that the proposed branch-and-bound algorithm competes favorably with a dynamic programming procedure. Note to Practitioners-Real-life production systems usually involve multiple machines and resources. The configurations of such systems may be complex and subject to change over time. Therefore, model-based solution approaches, which aim to solve scheduling problems for specific configurations, will inevitably run into difficulties. By contrast, decomposition methods are much more expressive and extensible. The single-machine problem and its solution procedure studied in this paper will prove useful to a decomposition method that decomposes multiple-machine, multiple-resource scheduling problems into a number of single-machine problems. The total weighted completion time objective is relevant to production environments where inventory levels and manufacturing cycle times are key concerns. Future research can be pursued along two directions. First, it seems to be necessary to further generalize the problem to consider also negative job weights. Second, the solution procedure developed here is ready to be incorporated into a machine-oriented decomposition method such as the shifting bottleneck procedure.

28 citations

Journal ArticleDOI
TL;DR: This paper constructs three alternative uncertainty sets, each of which defines job processing times that can simultaneously occur, and examines the problem of identifying a set of worst-case processing times with respect to a fixed schedule.
Abstract: In this paper, we study a robust single-machine scheduling problem under four alternative optimization criteria: minimizing total completion time, minimizing total weighted completion time, minimizing maximum lateness, and minimizing the number of late jobs. We assume that job processing times are subject to uncertainty. Accordingly, we construct three alternative uncertainty sets, each of which defines job processing times that can simultaneously occur. The robust optimization framework assumes that, given a job schedule, a worst-case set of processing times will be realized from among those allowed by the uncertainty set under consideration. For each combination of objective function and uncertainty set, we first analyze the problem of identifying a set of worst-case processing times with respect to a fixed schedule, and then investigate the problem of selecting a schedule whose worst-case objective is minimal.

28 citations

Journal ArticleDOI
TL;DR: An algorithm is presented which improves the complexity of searching the swap neighborhood from O(n^3) to O( n^2) and it is shown that this result also improvesThe complexity of the recently developed dynasearch heuristics.

28 citations

Journal ArticleDOI
TL;DR: This work proposes a heuristic algorithm for the general problem with resource dependent release times and processing times, by utilizing some derived optimal properties and analyzing its performance bound.

28 citations

Journal ArticleDOI
01 Aug 2003
TL;DR: A general procedure to find the efficient schedule that minimizes a composite function of the two criteria by evaluating only a small fraction of the efficient solutions for bicriteria problems is developed.
Abstract: In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite function of the two criteria by evaluating only a small fraction of the efficient solutions. We adapt the general procedures for the bicriteria problem of minimizing maximum earliness and the number of tardy jobs.

28 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