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 published on a yearly basis
Papers
More filters
TL;DR: A pseudopolynomial algorithm and a branch and bound algorithm in which lower bounds are obtained using the dynamic programming state-space relaxation method is proposed for this general problem of scheduling a single machine to minimize total weighted late work.
Abstract: In the problem of scheduling a single machine to minimize total weighted late work, there are n jobs to be processed for which each has an integer processing time, a weight and a due date. The objective is to minimize the total weighted late work, where the late work for a job is the amount of processing of this job which is performed after its due date. An O(n log n) algorithm is derived for the preemptive total weighted late work problem. For non-preemptive scheduling, efficient algorithms are derived for the special cases in which all processing times are equal and in which all due dates are equal. A pseudopolynomial algorithm is presented for the general non-preemptive total weighted late work problem. Also, a branch and bound algorithm in which lower bounds are obtained using the dynamic programming state-space relaxation method is proposed for this general problem. Computational results with the branch and bound algorithm for problems with up to 700 jobs are given. INFORMS Journal on Computing, ISSN...
56 citations
TL;DR: New approaches are developed for the single machine scheduling problem that generate near optimal solutions after the original stochastic problem is transformed into a non-linear integer programming model and its relaxations.
56 citations
TL;DR: A static stochastic single machine scheduling problem in which jobs have random processing times with arbitrary distributions, due dates are known with certainty, and fixed individual penalties are imposed on both early and tardy jobs is studied.
56 citations
TL;DR: This paper provides a fully polynomial-time approximation scheme for the makespan problem with release dates and analyzes the computational complexities of the problems for distinct objective functions and presents pseudo-polynomial-time algorithms.
55 citations
TL;DR: This work considers several two-agent scheduling problems with assignable due dates on a single machine, where each of the agents wants to minimize a measure depending on the completion times of its own jobs and the due dates are treated as given variables and must be assigned to individual jobs.
55 citations