scholarly journals Parallel-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times and Aging Maintenance

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Wei-min Ma ◽  
Li Sun ◽  
Xue-qin Zeng ◽  
Lei Ning
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Polynomial Algorithms ◽  
Scheduling Problems ◽  
Absolute Deviation ◽  
Total Load ◽  
Delivery Times ◽  
Sequence Dependent ◽  
Machine Scheduling Problems

We consider parallel-machine scheduling problems with past-sequence-dependent (psd) delivery times and aging maintenance. The delivery time is proportional to the waiting time in the system. Each machine has an aging maintenance activity. We develop polynomial algorithms to three versions of the problem to minimize the total absolute deviation of job completion times, the total load, and the total completion time.

Parallel-Machine Scheduling with Delivery Times and Deteriorating Maintenance

2015 ◽  
Vol 32 (04) ◽  
pp. 1550029 ◽  
Author(s):  
Wei-Min Ma ◽  
Li Sun ◽  
S. C. Liu ◽  
T. H. Wu
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Absolute Deviation ◽  
Total Load ◽  
Delivery Times ◽  
Polynomial Time Algorithms ◽  
Deteriorating Maintenance ◽  
Time Required ◽  
Completion Times

In this paper, we consider parallel-machine scheduling with past-sequence-dependent (p-s-d) delivery times and deteriorating maintenance. The delivery time of a job is proportional to its waiting time in the system. Each machine has a deteriorating maintenance activity, i.e., delaying the maintenance increases the time required to perform it. We consider three versions of the problem to minimize the total absolute deviation of job completion times, the total load on all the machines, and the total completion time. We develop polynomial-time algorithms to solve them.

Parallel Machine Scheduling Problems

2013 ◽  
pp. 189-215
Author(s):  
Alessandro Agnetis ◽  
Jean-Charles Billaut ◽  
Stanisław Gawiejnowicz ◽  
Dario Pacciarelli ◽  
Ameur Soukhal
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problems ◽  
Machine Scheduling Problems

scholarly journals Two Parallel-Machine Scheduling Problems with Function Constraint

2020 ◽  
Vol 2020 ◽  
pp. 1-6 ◽  
Author(s):  
Chia-Lun Hsu ◽  
Jan-Ray Liao
Keyword(s):  
Completion Time ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Total Completion Time ◽  
Scheduling Problems ◽  
Worst Case ◽  
Time Problem ◽  
Constraint Problem ◽  
Machine Scheduling Problems

The objective of this paper is to minimize both the makespan and the total completion time. Since parallel-machine scheduling which contains the function constraint problem has been a new issue, this paper explored two parallel-machine scheduling problems with function constraint, which refers to the situation that the two machines have a same function but one of the machines has another. We pointed out that the function constraint occurs not only in the manufacturing system but also in the service system. For the makespan problem, we demonstrated that it is NP-hard in the ordinary sense. In addition, we presented a polynomial time heuristic for this problem and have proved its worst-case ratio is not greater than 5/4. Furthermore, we simulated the performance of the algorithm through computational testing. The overall mean percent error of the heuristic is 0.0565%. The results revealed that the proposed algorithm is quite efficient. For the total completion time problem, we have proved that it can be solved in On4 time.

scholarly journals Modified Harris Hawks Optimizer for Solving Machine Scheduling Problems

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1460
Author(s):  
Hamza Jouhari ◽  
Deming Lei ◽  
Mohammed A. A. Al-qaness ◽  
Mohamed Abd Elaziz ◽  
Robertas Damaševičius ◽  
...  
Keyword(s):  
Computation Time ◽  
Machine Scheduling ◽  
Setup Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problems ◽  
Large Problem ◽  
Unrelated Parallel Machine Scheduling ◽  
Problem Instances ◽  
Machine Scheduling Problems

Scheduling can be described as a decision-making process. It is applied in various applications, such as manufacturing, airports, and information processing systems. More so, the presence of symmetry is common in certain types of scheduling problems. There are three types of parallel machine scheduling problems (PMSP): uniform, identical, and unrelated parallel machine scheduling problems (UPMSPs). Recently, UPMSPs with setup time had attracted more attention due to its applications in different industries and services. In this study, we present an efficient method to address the UPMSPs while using a modified harris hawks optimizer (HHO). The new method, called MHHO, uses the salp swarm algorithm (SSA) as a local search for HHO in order to enhance its performance and to decrease its computation time. To test the performance of MHHO, several experiments are implemented using small and large problem instances. Moreover, the proposed method is compared to several state-of-art approaches used for UPMSPs. The MHHO shows better performance in both small and large problem cases.

Sign in / Sign up

Export Citation Format

Share Document