Solving multi-objective parallel machine scheduling problem by a modified NSGA-II

اسناد مشابه

• Fuzzy Multi-Objective Parallel Machines Scheduling Problem through New Solution Method

  سند علمی۲۰۱۲Mohammad Asghari

  One of the basic and significant problems that a shop or a factory manager encounters is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is just-in-time scheduling. Motivated by just-intime manufacturing, we consider the multi-objective pr

• A Global Archive Sub-Population Genetic Algorithm with Adaptive Strategy in Multi-objective Parallel-Machine Scheduling Problem

  سند علمی۲۰۰۶ICNCPei-Chann Chang, Shih-Hsin Chen, Jih-Chang Hsieh

  1. Experiment design for parameters settings in SPGA There are several parameters that may influence the performance of the algorithm. For example, the larger population size may find better solution quality but cost larger computational expense. When the number of sub-population

• The use of a fuzzy multi-objective linear programming for solving a multi-objective single-machine scheduling problem

  سند علمی۲۰۱۰Appl. Soft Comput.Reza Tavakkoli-Moghaddam, Babak Javadi, Fariborz Jolai, Ali Ghodratnama

  This paper develops a fuzzy multi-objective linear programming (FMOLP) model for solving a multiobjective single-machine scheduling problem. The proposed model attempts to minimize the total weighted tardiness andmakespan simultaneously. In this problem, a proposed FMOLPmethod is

• Solving Three Objectives Single-Machine Scheduling Problem Using Fuzzy Multi-Objective Linear Programming

  مقاله‌ی دسترسی آزاد۲۰۲۳Ma?alla? Tikr?t li-l-?ul?m al-?irfa?['None Dara A. Hassan', 'None Nezam M. Amiri', 'None Ayad M. Ramadan', '']

  In this paper, three criteria scheduling problem of n jobs on a single machine is considered. Each these to be processed without interruption and becomes available for processing at time zero. The minimize objectives simultaneously, which are the completion time, maximum tardines

• A Hybrid Algorithm for Solving the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times

  سند علمی۲۰۱۱Matheus N. Haddad, Marcone J. F. Souza, Maria Cláudia F. M. C. Souza, Vitor N. Coelho

  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 pr

• AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times

  سند علمی۲۰۱۴ICEISMatheus Nohra Haddad, Luciano Perdigão Cota, Marcone J. F. Souza, Nelson Maculan

  This paper deals with the Unrelated Parallel Machine Scheduling Problem with Setup Times (UPMSPST). The objective is to minimize the maximum completion time of the schedule, the so-called makespan. This problem is commonly found in industrial processes like textile manufacturing