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: In this paper, a mixed-integer linear programming (MILP) model was proposed to solve the prize-collecting single machine scheduling problem with sequence-dependent setup times, where each job has a weight and a processing time, and during processing a symmetric sequencedependent setup time exists between two consecutive jobs.
16 citations
TL;DR: An intensive search evolutionary algorithm is proposed to solve single machine total weighted tardiness scheduling problems and it is observed that the proposed evolutionary algorithm provides better results than others.
Abstract: In this paper, an intensive search evolutionary algorithm is proposed to solve single machine total weighted tardiness scheduling problems. A specialised locally improved random swap mutation operator and an ordered crossover operator are used for evolution. The proposed algorithm starts with a pair of sequences: one generated by a greedy heuristic, namely, a backward phase heuristic acts as one parent, and a randomly generated sequence acts as the other. A computational experiment is conducted by applying the mutation operator on the backward phase sequence and the proposed algorithm with the same number of generations as the termination criteria. A total of 125 benchmark instances for sizes 40, 50 and 100 available in the OR library are solved and the results are compared with the available best-known results. It is observed that the proposed evolutionary algorithm provides better results than others .
16 citations
TL;DR: This paper shows that the single machine scheduling of minimizing total weighted tardiness with generalized due dates is unary NP-hard.
16 citations
TL;DR: The proposed decision-tree-based approach, Generation of Rules Automatically with Feature construction and Tree-based learning (GRAFT), outperforms the existing dispatching rules and is effective in terms of extracting scheduling insights in such understandable formats as IF–THEN rules from existing schedules.
Abstract: In this paper, we address the dynamic single-machine scheduling problem for minimisation of total weighted tardiness by learning of dispatching rules (DRs) from schedules. We propose a decision-tre...
16 citations
TL;DR: The general problem of scheduling n jobs on a single machine where the job value deteriorates with its starting time is shown to be unary NP-hard and is modelled as a time index integer program.
Abstract: This paper considers the problem of scheduling n jobs on a single machine where the job value deteriorates with its starting time. The objective of the problem is to maximize the cumulative value of all jobs. The problem is motivated from the real-life applications, such as movie scheduling, remanufacturing of high-technology products, web object transmission, and banner advertising. Unrestricted, truncated, and capacity constrained job value functions are considered. Some special cases of the problem, such as the unrestricted linear job value function, are polynomially solvable. The general problem is shown to be unary NP-hard and is modelled as a time index integer program. For the NP-hard cases, several heuristics are proposed. Results of the empirical evaluation of the relative performance of the proposed heuristics on critical parameters are reported.
16 citations