Abstract
This research focuses on the problem of scheduling a set of jobs on unrelated parallel machines subject to release dates, sequence-dependent setup times, and additional renewable resource constraints. The objective is to minimize the maximum completion time (makespan). To optimize the problem, a modified harmony search (MHS) algorithm was proposed. The parameters of MHS are regulated using full factorial analysis. The MHS algorithm is examined, evaluated, and compared to the best methods known in the literature. Four algorithms were represented from similar works in the literature. A benchmark instance has been established to test the sensitivity and behavior of the problem parameters of the different algorithms. The computational results of the MHS algorithm were compared with those of other metaheuristics. The competitive performance of the developed algorithm is verified, and it was shown to provide a 42% better solution than the others.
Highlights
Scheduling is the procedure of arranging, controlling, and optimizing workloads in a production process or manufacturing process
The unrelated parallel machine’s problem subject to release dates, sequence-dependent setup times, and additional renewable resource constraints is frequently found in many practical situations, such as in the textile and chemical industries, the scheduling of project in transportation construction, etc., which makes the contribution of this paper theoretical and practical that was instigated by the nature of the solved problem
If the saturation percentage is greater than low saturation (LSat) and smaller than high saturation (HSat), the large portion recovery rate (LPRR) is equivalent to ULPRR, and the pitch adjustment rate (PAR) is equal to LPAR
Summary
Scheduling is the procedure of arranging, controlling, and optimizing workloads in a production process or manufacturing process. Lin and Hsieh [11] studied scheduling unrelated parallel machines with sequence- and machine-dependent setup times to minimize total weighted tardiness They used several approaches such as the mixed-integer programming model, heuristic, and iterated hybrid metaheuristic. Zeidi and Hosseini [15] presented a mathematical model to solve the problem of scheduling jobs on unrelated parallel machines with sequence-dependent setup times under due-date constraints They proposed an algorithm to minimize the total cost of tardiness and earliness. The unrelated parallel machine’s problem subject to release dates, sequence-dependent setup times, and additional renewable resource constraints is frequently found in many practical situations, such as in the textile and chemical industries, the scheduling of project in transportation construction, etc., which makes the contribution of this paper theoretical and practical that was instigated by the nature of the solved problem.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
