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, the authors give optimality conditions to obtain a priori precedence relationships among some of the jobs in a single machine scheduling problem so as to curtail the enumeration while using branch-based methods.
Abstract: This paper gives optimality conditions to obtain a priori precedence relationships among some of the jobs in a single machine scheduling problem so as to curtail the enumeration while using branch-...
30 citations
TL;DR: In this article, the authors consider a new deterioration model where the actual job processing time of a job is a function of the processing times of the jobs already processed and show that the single-machine scheduling problems to minimize the makespan and total completion time remain polynomially solvable under the proposed model.
30 citations
01 Jan 2012
TL;DR: This paper investigates a new approach for solving the multiobjective job shop scheduling problem, namely the Cuckoo Search (CS) approach, and shows that CS is a very effective and promising technique to solveJob shop scheduling problems.
Abstract: This paper investigates a new approach for solving the multiobjective job shop scheduling problem, namely the Cuckoo Search (CS) approach The requirement is to schedule jobs on a single machine so that the total material waste is minimised as well as the total tardiness time The material waste is quantified in terms of saving factors to show the reduction in material that can be achieved when producing two jobs with the same materials in sequence The estimated saving factor is used to calculate a cost savings for each job based on its material type A formulation of multiobjective optimisation problems is adopted to generate the set of schedules that maximise the overall cost savings and minimise the total tardiness time, where all trade-offs are considered for the two conflicting objectives A Pareto Archived Multiobjective Cuckoo Search (PAMOCS) is developed to find the set of nondom-inated Pareto optimal solutions The solution accuracy of PAMOCS is shown by comparing the closeness of the obtained solutions to the true Pareto front generated by the complete enumeration method Results show that CS is a very effective and promising technique to solve job shop scheduling problems
30 citations
TL;DR: The results of a simulation experiment indicate that the proposed annealing approach for solving the single machine mean tardiness scheduling problem provides much better solutions than two heuristics that gave good results in previous studies.
30 citations
TL;DR: This paper examines a single machine scheduling problem with random processing times and deadline, and shows that the problem can be efficiently solved as long as the cost parameter is agreeable or an approximate solution is acceptable.
29 citations