A Statistical Comparison of Metaheuristics for Unrelated Parallel Machine Scheduling Problems with Setup Times
نویسندگان
چکیده
Manufacturing scheduling aims to optimize one or more performance measures by allocating a set of resources jobs tasks over given period time. It is an area that considers very important decision-making process for manufacturing and production systems. In this paper, the unrelated parallel machine problem with machine-dependent job-sequence-dependent setup times addressed. This involves on machines in order minimize makespan. The genetic algorithm used solve small large instances when processing are balanced (Balanced problems), dominant (Dominant P S problems). For instances, most values achieved optimal makespan value, and, compared metaheuristic ant colony optimization (ACOII) referred literature, it was found there were no significant differences between two methods. However, terms obtained methods, revealing overall better Dominant problems.
منابع مشابه
Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملA Hybrid Algorithm for Solving the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times
This work addresses the unrelated parallel machine scheduling problem where setup times are sequence-dependent and machine-dependent. The maximum completion time of the schedule, known as makespan, is considered as an objective to minimize. Few studies has been done about this problem, which is a motivation to the development of this work. Other motivations are the fact that it is NP-Hard and i...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملHeuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times
The problem addressed in this paper is the non-preemptive unrelated parallel machine scheduling problem with the objective of minimizing the makespan. Machine-dependent and job sequence-dependent setup times are considered, all jobs are available at time zero, and all times are deterministic. This is a NP-hard problem and in this paper, optimal solutions are found for small problems only. For l...
متن کاملSequencing Heuristics for Flexible Flow Shop Scheduling Problems with Unrelated Parallel Machines and Setup Times
This paper presents an investigation of scheduling procedures to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop scheduling environment. The flexible flow shop problem is a scheduling of jobs in a flow shop environment consisting of series of production stages, some of which may have only one machine, but at least one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10142431