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: Computational results indicate that this procedure improves the initial schedule and the solution quality is higher than that of the existing procedures in most situations while the computational efforts are moderate.
14 citations
TL;DR: A mathematical model for scheduling of a single machine when there are preemptions in jobs is presented and it is indicated that competition sampling has reached optimal solutions for small scale problems and it could obtain better near-optimal solutions in relatively lower running time compared with other sampling methods.
Abstract: Article history: Received November 4 2015 Received in Revised Format February 21 2016 Accepted March 21 2016 Available online March 22 2016 This paper presents a mathematical model for scheduling of a single machine when there are preemptions in jobs. The primary objective of the study is to minimize different objectives such as earliness, tardiness and work in process. The proposed mathematical problem is considered as NP-Hard and the optimal solution is available for small scale problems. Therefore, a genetic algorithm (GA) is developed to solve the problem for large-scale problems. The implementation of the proposed model is compared with GA for problems with up to 50 jobs using three methods of roulette wheel sampling, random sampling and competition sampling. The results have indicated that competition sampling has reached optimal solutions for small scale problems and it could obtain better near-optimal solutions in relatively lower running time compared with other sampling methods. © 2016 Growing Science Ltd. All rights reserved
14 citations
TL;DR: This article provides a branch-and-bound algorithm to search for the optimal solution and a genetic algorithm equipped with a local search to obtain near-optimal solutions for a single-machine scheduling problem with learning effects.
Abstract: Scheduling with learning effects or scheduling with two competing agents has been widely studied in recent years. However, they are seldom discussed at the same time. In this article, we consider a...
14 citations
TL;DR: This work studies a single machine scheduling problem, where the machine is unavailable for processing for a pre-specified time period and the objective functions considered are minimum makespan, minimum total completion time and minimum number of tardy jobs.
14 citations
TL;DR: Experimental results confirm the robustness of schedules produced and advantages of the proposed TSH over other algorithms in terms of solution quality and run time, and develop a method to calculate the lower bound of the suggested model.
Abstract: We study a single machine scheduling problem (SMSP) with uncertain job release times (JRTs) under the maximum waiting time (MWT) criterion. To deal with the uncertainty, a robust model is establish...
14 citations