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 shown that even with the introduction of a time-dependent learning effect and deteriorating jobs to job processing times, the single machine makes the total completion time minimization problem remain polynomially solvable.
Abstract: The paper deals with the single machine scheduling problems with a time-dependent learning effect and deteriorating jobs. By the effects of time-dependent learning and deterioration, we mean that the processing time of a job is defined by function of its starting time and total normal processing time of jobs in front of it in the sequence. It is shown that even with the introduction of a time-dependent learning effect and deteriorating jobs to job processing times, the single machine makespan minimization problem remain polynomially solvable. But for the total completion time minimization problem, the classical shortest processing time first rule or largest processing time first rule cannot give an optimal solution.
73 citations
TL;DR: One of the established heuristic methods for the single machine scheduling problem is modified and extended to provide a solution method for the permutation flow-shop problem using a pair exchange mechanism with directionality constraint.
73 citations
TL;DR: This note considers a single machine scheduling and due-window assignment problem, in which the processing time of a job is a linear function of its starting time and the job-independent deterioration rates are identical for all jobs.
72 citations
72 citations
TL;DR: An O( n 2 ) time approximation algorithm for the problem of minimizing the total weighted tardiness in single machine scheduling, where n is the number of jobs, and a fully polynomial-time approximation scheme is constructed.
72 citations