A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times

2012 ◽  
Vol 39 (7) ◽  
pp. 1411-1418 ◽  
Author(s):  
Subhash C. Sarin ◽  
Lixin Wang ◽  
Ming Cheng
Keyword(s):  
Single Machine ◽  
Scheduling Problem ◽  
Wafer Processing ◽  
Completion Times

scholarly journals Single Machine Predictive Scheduling Using Inserted Idle Times

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Hongli Zhu ◽  
Hong Zhou
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Primary Objective ◽  
Computational Experiments ◽  
Scheduling Problem ◽  
High Predictability ◽  
Surrogate Measure ◽  
Predictive Scheduling ◽  
Completion Times

A single machine predictive scheduling problem is considered. The primary objective is to minimize the total completion times. The predictability of the schedule is measured by the completion time deviations between the predictive schedule and realized schedule. The surrogate measure of predictability is chosen to evaluate the completion time deviations. Both of the primary objective and predictability are optimized. In order to absorb the effects of disruptions, the predictive schedule is generated by inserting idle times. Right-shift rescheduling method is used as the rescheduling strategy. Three methods are designed to construct predictive schedules. The computational experiments show that these algorithms provide high predictability with minor sacrifices in shop performance.

scholarly journals Task Scheduling Problem Using Fuzzy Graph

2016 ◽  
Vol 1 (1-2) ◽  
pp. 16-20
Author(s):  
Vivek Raich ◽  
Shweta Rai
Keyword(s):  
Task Scheduling ◽  
Single Machine ◽  
Scheduling Problem ◽  
Scheduling Theory ◽  
Scheduling Problems ◽  
Fuzzy Graph ◽  
Minimum Value ◽  
Chromatic Sum ◽  
Completion Times

The concept of obtaining fuzzy sum of fuzzy colorings problem has a natural application in scheduling theory. The problem of scheduling N jobs on a single machine and obtain the minimum value of the job completion times is equivalent to finding the fuzzy chromatic sum of the fuzzy graph modeled for this problem. The aim of this paper is to solve task scheduling problems using fuzzy graph.

scholarly journals Hybridization Simulated Annealing Algorithm in a Single Machine Scheduling Problem

2021 ◽  
Vol 20 ◽  
pp. 597-605
Author(s):  
Hafed M. Motair
Keyword(s):  
Simulated Annealing ◽  
Single Machine ◽  
Simulated Annealing Algorithm ◽  
Optimal Solution ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Metaheuristic Algorithm ◽  
Annealing Algorithm ◽  
Completion Times

In this paper, we investigate a single machine scheduling problem (SMSP). We try to reach the optimal or near optimal solution which minimize the sum of three objective functions: total completion times, total tardiness and total earliness. Firstly, we solve this problem by Branch and bound algorithm (BAB alg) to find optimal solutions, dominance rules (DR)s are used to improve the performance of BAB alg, the resulting is BABDR, secondly, we solve this problem by simulated annealing algorithm (SA alg) as metaheuristic algorithm (MET alg). It is known that combining MET alg with other algorithms can improve the resulting solutions. In this paper we developed the concept of insertion preselected jobs one by one through all positions of remaining jobs of considered sequence, the proposed MET alg called Insertion Metaheuristic Algorithm (IMA). This procedure improves the performance of SA alg in two directions: in the first one, we use the IMA to generate initial solution for SA alg, in the second one, we use the IMA to improve the solution obtained through the iterations of SA alg. The experiments showed that IMA can improve the performance of SA alg in these two directions.

Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance

2019 ◽  
Vol 75 (1) ◽  
pp. 291-320 ◽  
Author(s):  
Hanane Krim ◽  
Rachid Benmansour ◽  
David Duvivier ◽  
Daoud Aït-Kadi ◽  
Said Hanafi
Keyword(s):  
Single Machine ◽  
Weighted Sum ◽  
Scheduling Problem ◽  
Periodic Maintenance ◽  
Completion Times ◽  
Sum Of Completion Times

scholarly journals AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES

2008 ◽  
Vol 25 (02) ◽  
pp. 169-186 ◽  
Author(s):  
JORGE M. S. VALENTE
Keyword(s):  
Branch And Bound ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Dominance Test ◽  
Branch And Bound Algorithms ◽  
Exact Approach ◽  
Lower Bounding ◽  
Completion Times

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We propose a lower bounding procedure based on the relaxation of the jobs' completion times. Optimal branch-and-bound algorithms are then presented. These algorithms incorporate the proposed lower bound, as well as an insertion-based dominance test. The branch-and-bound procedures are tested on a wide set of randomly generated problems. The computational results show that the branch-and-bound algorithms are capable of optimally solving, within reasonable computation times, instances with up to 20 jobs.

Sign in / Sign up

Export Citation Format

Share Document