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: It is proved in this note that single-machine scheduling with a common due date to minimize earliness-tardiness and batch delivery costs is strongly NP-hard by a simple reduction from 3-Partition.
39 citations
TL;DR: In this article, the authors investigated a single machine scheduling problem with deteriorating jobs, where the job deterioration is described by a function which is proportional to a linear function of time, and the objective is to find a schedule that minimizes total absolute differences in completion times.
39 citations
TL;DR: A fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal.
39 citations
TL;DR: This work considers several two-agent single-machine scheduling problems with deteriorating jobs, and considers six scheduling problems associated with different combinations of the two agents' objective functions, which include the maximum cost, total weighted completion time, discounted total weighted completed time, maximum earliness cost,total earliness, and total weighted earliness.
39 citations
TL;DR: It is proved that both single-machine scheduling problems with deteriorating effects and a machine maintenance are polynomial time solvable and the corresponding algorithms are provided.
Abstract: In this paper, the single-machine scheduling problems with deteriorating effects and a machine maintenance are studied. In this circumstance, the deterioration rates of the jobs during the machinin...
39 citations