scholarly journals Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

2011 ◽  
Vol 38 (4) ◽  
pp. 771-781 ◽  
Author(s):  
M. Selim Akturk ◽  
Taylan Ilhan
Keyword(s):  
Machine Scheduling ◽  
Total Weighted Tardiness ◽  
Controllable Processing Times ◽  
Cnc Machine ◽  
Weighted Tardiness ◽  
Processing Times

scholarly journals Sum-of-Processing-Times-Based Two-Agent Single-Machine Scheduling with Aging Effects and Tardiness

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Do Gyun Kim ◽  
Jin Young Choi
Keyword(s):  
Genetic Algorithm ◽  
Single Machine ◽  
Optimal Solution ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Weighted Tardiness ◽  
Aging Effects ◽  
Weighted Tardiness ◽  
Processing Times ◽  
Tardy Jobs

We consider a two-agent single-machine scheduling problem that minimizes the total weighted tardiness of one agent under the restriction that the second agent is prohibited from having tardy jobs. The actual processing times of all jobs are affected by a sum-of-processing-times-based aging effect. After showing the NP-hardness of the problem, we design a branch-and-bound (B&B) algorithm to find an optimal solution by developing dominance properties and a lower bound for the total weighted tardiness to increase search efficiency. Because B&B takes a long time to find an optimal solution, we propose a genetic algorithm as an efficient, near optimal solution approach. Four methods for generating initial populations are considered, and edge recombination crossover is adopted as a genetic operator. Through numerical experiments, we verify the outstanding performance of the proposed genetic algorithm.

Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration

2016 ◽  
Vol 33 (01) ◽  
pp. 1650001 ◽  
Author(s):  
Chun-Lai Liu ◽  
Jian-Jun Wang
Keyword(s):  
Processing Time ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Controllable Processing Times ◽  
Maintenance Activity ◽  
Processing Times ◽  
Unrelated Parallel Machine Scheduling ◽  
Deteriorating Maintenance ◽  
Maintenance Activities

In this paper, we study the problem of unrelated parallel machine scheduling with controllable processing times and deteriorating maintenance activity. The jobs are nonresumable. The processing time of each job is a linear function of the amount of a continuously divisible resource allocated to the job. During the planning horizon, there is at most one maintenance activity scheduled on each machine. Additionally, if the starting time of maintenance activity is delayed, the length of the maintenance activity required to perform will increase. Considering the total completion times of all jobs, the impact of maintenance activity in the form of the variation in machine load and the amounts of compression, we need to determine the job sequence on each machine, the location of maintenance activities and processing time compression of each job simultaneously. Accordingly, a polynomial time solution to the problem is provided.

Sign in / Sign up

Export Citation Format

Share Document