Scope and Purpose|Airline crew scheduling is a very visible and economically signiicant problem. Because of its widespread use, economic signiicance, and diiculty of solution, the problem has attracted the attention of the operations research community for over twenty-ve years. The purpose of this paper was to develop a genetic algorithm for the airline crew scheduling problem, and to compare i...

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

A hybrid particulate swarm optimization (hybrid) combination of an algorithm the particle and a variable neighborhood search is proposed for multi-objective permutation flow shop scheduling problem (PFSP) with smallest cumulative completion time total time. Algorithm (HPSO) applied to maintain fair centralized decentralized search. The Nawaz-Enscore-Ham )NEH) heuristic in this used initialize p...

A new hybrid flow shop scheduling problem with blocking is studied. The problem is characterized by multistage unrelated parallel machines and no intermediate buffer. Firstly, the math model of the hybrid scheduling problem is constructed. And then the computation method of production period is given. Due to there is no intermediate buffer, and there are unrelated parallel machines in multi-sta...

This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

The two-stage assembly flowshop scheduling problem is addressed with the objective of minimizing total tardiness. An insertion algorithm, a genetic algorithm, and a hybrid of the insertion and genetic algorithms, are developed for the problem. Conducted computational experiments reveal that the hybrid algorithm significantly outperforms the genetic algorithm while the best performing algorithm ...

To improve the management of collaborative manufacturing tasks in MES and promote digital transformation discrete enterprises, based on has been studied. First, business flow an was analyzed systematically. Second, algorithm detailed scheduling for studied, a model external resources designed. Then, solution presented hybrid genetic algorithm. Finally, execution process promoted integration ERP...