scholarly journals Computational Experiments on Workflow Balancing of Parallel Machine Scheduling with Precedence Constraints and Sequence Independent Setup Time

2020 ◽  
pp. 154-161
Keyword(s):  
Parallel Machines ◽  
Setup Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Precedence Constraints ◽  
The Other ◽  
Computational Experiments ◽  
Relative Percentage ◽  
Parallel Machines Scheduling ◽  
Alternate Schedule

The workflow balancing of parallel machines scheduling (PMS) with precedence constraints and sequence independent setup time is considered for study. The setup time consideration produces alternate schedule along with lesser relative percentage of imbalance (RPI) value for PMS problem is demonstrated with an example. The lesser RPI indicates better workflow balancing among machines. The computational experiments are conducted on large instances of randomly generated PMS problems with precedent constraints and setup time. The various combinations of heuristics are used to solve the problems. The results show that genetic algorithm (GA) performs well against the other heuristics with lesser RPI values

scholarly journals Online Algorithms for a Generalized Parallel Machine Scheduling Problem

MACRo 2015 ◽  
2015 ◽  
Vol 1 (1) ◽  
pp. 193-200
Author(s):  
István Szalkai ◽  
György Dósa
Keyword(s):  
Online Algorithms ◽  
Parallel Machines ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
The Other ◽  
Workflow Scheduling ◽  
Scheduling Problem ◽  
Parallel Machine Scheduling Problem

AbstractWe consider different online algorithms for a generalized scheduling problem for parallel machines, described in details in the second section. This problem is the generalization of the classical parallel machine scheduling problem, when the makespan is minimized; in that case each job contains only one task. On the other hand, the problem in consideration is still a special version of the workflow scheduling problem. We present several heuristic algorithms and compare them by computer tests.

scholarly journals IDENTICAL PARALLEL MACHINES SCHEDULING USING GENETIC ALGORITHM

2018 ◽  
Vol 18 (2) ◽  
pp. 321-330
Author(s):  
Aseel J Haleel
Keyword(s):  
Genetic Algorithm ◽  
Processing Time ◽  
Parallel Machines ◽  
Machine Scheduling ◽  
Setup Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Scheduling Problem ◽  
Identical Parallel Machine ◽  
Parallel Machine Scheduling Problem

Minimizing the scheduling production time consider one of the most important factors forcompanies which their objectives is achieve the maximum profits. This paper studies theidentical parallel machine scheduling problem which involves the assignment numbers ofjob (N) to set of identical parallel machine (M) in order to minimize the makespan(maximum completion time of all job). There are numerous troubles in solving the largesize of “parallel machine scheduling” problem with an excessive jobs and machines, sothe genetic algorithm was proposed in this paper which is consider an efficient algorithmthat fits larger size of identical “parallel machine scheduling” for minimizing themakespan. Most studies in the scheduling field suppose setup time is insignificant orincluded in the processing time, in this paper both the sequence independent setup timesand processing time were considered. The solutions of algorithms are coding in(MATLAB). A numerical example of (11) jobs are schedule on (3) machines todemonstrative the effectiveness of algorithm solution. The result show the algorithm caneffectively solve large size of scheduling problem and given the best schedule withminimum makespan.

scholarly journals Scheduling on a Single Machine and Parallel Machines with Batch Deliveries and Potential Disruption

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Hua Gong ◽  
Yuyan Zhang ◽  
Puyu Yuan
Keyword(s):  
Polynomial Time ◽  
Single Machine ◽  
Manufacturing Industry ◽  
Parallel Machines ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Approximation Schemes ◽  
Scheduling Problems ◽  
Delivery Scheduling ◽  
Production Part

In this paper, we study several coordinated production-delivery scheduling problems with potential disruption motivated by a supply chain in the manufacturing industry. Both single-machine environment and identical parallel-machine environment are considered in the production part. The jobs finished on the machines are delivered to the same customer in batches. Each delivery batch has a capacity and incurs a delivery cost. There is a situation that a possible disruption in the production part may occur at some particular time and will last for a period of time with a probability. We consider both resumable case and nonresumable case where a job does not need (needs) to restart if it is disrupted for a resumable (nonresumable) case. The objective is to find a coordinated schedule of production and delivery that minimizes the expected total flow times plus the delivery costs. We first present some properties and analyze the NP-hard complexity for four various problems. For the corresponding single-machine and parallel-machine scheduling problems, pseudo-polynomial-time algorithms and fully polynomial-time approximation schemes (FPTASs) are presented in this paper, respectively.

An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times

2014 ◽  
Vol 31 (05) ◽  
pp. 1450039 ◽  
Author(s):  
Yiwei Jiang ◽  
Huijuan Wang ◽  
Ping Zhou
Keyword(s):  
Parallel Machines ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Solution Algorithm ◽  
Single Server ◽  
Preemptive Scheduling ◽  
Scheduling Problem ◽  
Identical Parallel Machines ◽  
Loading And Unloading

We study a preemptive scheduling problem on two identical parallel machines that share a common server. Each job has to be loaded by the server before being processed on one of the machines and unloaded by the server after its processing. The loading and unloading times are both equal to one time unit. The goal is to minimize the makespan. We propose a O(n log n) solution algorithm for the preemptive variant of the problem.

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