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: An important finding of these empirical investigations is that scheduling jobs by removing the group technology assumption can significantly reduce total earliness and tardiness.
29 citations
••
TL;DR: Experimental results show that CIGA outperformed the other GAs with better quality of solutions, and stores the solved problems in the case base for future retrievals.
29 citations
••
TL;DR: A branch-and-bound algorithm and four heuristic algorithms to search for the optimal and near-optimal solutions to a single-machine problem with learning effects, where the objective is to minimize the total weighted completion time of jobs from the first agent.
29 citations
••
TL;DR: It is proved that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore's algorithm can construct an optimal schedule for the problem to minimize these objective functions, respectively.
Abstract: In this study we consider the single-machine scheduling problem with a sum-of-processing-times-based learning effect. The sum-of-processing-times-based learning effect of a job is assumed to be a function of the sum of the normal processing times of the already processed jobs. We prove that the shortest processing time (SPT) rule is optimal for the sum of completion times square minimization problem. We also show by examples that the optimal schedule for the classical version of the problem is not optimal in the presence of a sum-of-processing-times-based learning effect for the following three objective functions: the weighted sum of completion times, the maximum lateness and the number of tardy jobs. But for some special cases, we prove that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore's algorithm can construct an optimal schedule for the problem to minimize these objective functions, respectively.
29 citations
••
TL;DR: It is shown that if the penalties meet a certain criterion, called the Dominance Condition, then there exists an extremal optimal solution to the LP-relaxation that is integral, leading to a polynomial-time solution procedure.
Abstract: The problem of determining a schedule of jobs with unit-time lengths on a single machine that minimizes the total weighted earliness and tardiness penalties with respect to arbitrary rational due-dates is formulated as an integer programming problem. We show that if the penalties meet a certain criterion, called the Dominance Condition, then there exists an extremal optimal solution to the LP-relaxation that is integral, leading to a polynomial-time solution procedure. The general weighted symmetric penalty structure is one cost structure that satisfies the Dominance Condition; we point out other commonly found penalty structures that also fall into this category.
29 citations