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: This work considers single machine scheduling problems with deteriorating jobs and SLK/DIF due window assignment, where the deteriorating rates of jobs are assumed to be job-dependent and develops algorithms for solving these problems in polynomial time.
Abstract: We consider single machine scheduling problems with deteriorating jobs and SLK/DIF due window assignment, where the deteriorating rates of jobs are assumed to be job-dependent. We consider two different objectives under SLK and DIF due window assignment, respectively. The first objective is to minimise total costs of earliness, tardiness, due window location and due window size, while the second objective is to minimise a cost function that includes number of early jobs, number of tardy jobs and the costs for due window location and due window size. We study the optimality properties for all problems and develop algorithms for solving these problems in polynomial time.
13 citations
TL;DR: The article shows that the problems to minimise the makespan, sum of the kth power of completion times, total lateness and sum of earliness penalties are polynomially solvable under the proposed model.
Abstract: This article introduces a general single-machine setup times scheduling model with learning effect and deteriorating jobs simultaneously which is a generalisation of some existing models in the literature. The setup times are proportional to the length of the already processed jobs, i.e. the setup times are past-sequence-dependent p-s-d. By the effects of learning and deterioration, we mean that the actual processing time of a job depends not only on the starting time of the job but also on its scheduled position. The article shows that the problems to minimise the makespan, sum of the k th power of completion times, total lateness and sum of earliness penalties with common due date are polynomially solvable under the proposed model. It further shows that the problems to minimise total weighted completion time, maximum lateness, maximum tardiness, total tardiness and total weighted earliness penalties with common due date are polynomially solvable under certain conditions.
13 citations
TL;DR: This paper establishes the complexity status of the single-machine scheduling problem by proving its NP-hardness and developing, a dynamic programming algorithm that solves the problem in pseudo-polynomial time.
12 citations
01 Sep 1993
TL;DR: In this paper, the earliness and tardiness (E/T) penalty problem in scheduling gained more importance in part due to its application in Just-In-Time (JIT) production system.
Abstract: The earliness and tardiness (E/T) penalty problem in scheduling gained more importance in part due to its application in Just-In-Time (JIT) production system. Inorder to meet JIT production schedules preventive maintenance plan must be in place. During the maintenance periods machine is not available for processing. The time duration planned for preventive maintenance or meal breaks is called machine vacation. Incorporating E/T penalty and machine vacation a single machine scheduling model is developed. Heuristic methods for solving this problem and computational results are also presented.
12 citations
TL;DR: A solution to a particular scheduling problem over a single machine in terms of closed-loop strategies is provided, taking into account the equivalence of jobs of the same class and service times.
Abstract: A particular scheduling problem over a single machine is considered. Jobs belong to different classes, and two jobs belonging to the same class are considered as completely equivalent. A sequence of due dates is specified for each class of jobs, and the serviced jobs, for each class, are assigned to the due dates according to the EDD rule. The service time of any job of a given class has to be selected within an interval of possible values (the highest possible one being the nominal service time). A deviation of the actual service time from the nominal value determines a cost that has a linear dependence on such a deviation. The cost function to be minimized is the sum of the total (weighted) tardiness cost and the overall service time deviation cost. The decision variables are those concerning job sequencing (taking into account the equivalence of jobs of the same class) and service times. In this paper, a solution to this problem is provided in terms of closed-loop strategies.
12 citations