Results 221 to 230 of about 32,492 (256)
Some of the next articles are maybe not open access.
2021
In the actual manufacturing process of seamless steel tubes, the scheduling of ordinary production workshops and cold drawing workshops is a problem with NP-hard characteristics. Aiming at ordinary production workshops and cold drawing workshops, distributed flow shop scheduling models and reentrant scheduling models are established.
Xiuli Wu, Zirun Xie
openaire +1 more source
In the actual manufacturing process of seamless steel tubes, the scheduling of ordinary production workshops and cold drawing workshops is a problem with NP-hard characteristics. Aiming at ordinary production workshops and cold drawing workshops, distributed flow shop scheduling models and reentrant scheduling models are established.
Xiuli Wu, Zirun Xie
openaire +1 more source
A hybrid method for scheduling problems of flow shop
Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788), 2004Scheduling is a very complex but important problem. Based on the mathematical model of the scheduling problem, a hybrid algorithm combined the genetic algorithm with the branch and bound method is proposed to solve the flow shop scheduling problems. As for the randomicity and uncertainty of the GA, the feasible space may be broad and the efficiency is ...
null Zhenhao Xu, null Xingsheng Gu
openaire +1 more source
A Hybrid Genetic Algorithm for the Flow-Shop Scheduling Problem
2006The flow-shop scheduling problem with the makespan criterion is an important production scheduling problem. Although this problem has a simple formulation, it is NP-hard. Therefore many heuristic and metaheuristic methods had been proposed to solve this problem. In this paper, a hybrid genetic algorithm is presented for the flow-shop scheduling problem.
Lin Yu Tseng 0001, Ya-Tai Lin
openaire +1 more source
Design of a testbed for hybrid flow shop scheduling with identical machines
Computers & Industrial Engineering, 2020Abstract In this paper, we present two extensive sets of instances for the hybrid flow shop scheduling problem. The first set is composed of 240 instances with a small number of jobs, while in the second set 240 instances with a large number of jobs are considered.
Victor Fernandez-Viagas +1 more
openaire +1 more source
Hybrid flow shop scheduling with parallel batching
International Journal of Production Economics, 2009Abstract In this research the problem of parallel batch scheduling in a hybrid flow shop environment with minimizing Cmax is studied. In parallel batching it is assumed that machines in some stages are able to process a number of operations simultaneously.
Mohammad Reza Amin-Naseri +1 more
openaire +1 more source
An efficient hybrid algorithm for a bi-objectives hybrid flow shop scheduling
Intelligent Automation and Soft Computing, 2018This paper considers the problem of scheduling n independent jobs in g-stage hybrid flow shop environment.
Seyyed Mostafa Mousavi, Mostafa Zandieh
openaire +1 more source
Hybrid Flow Shop Scheduling with Several Users
2011Schedules have implications that are experienced collectively by a number of different persons with different responsibilities. It is, therefore, reasonable to make scheduling decisions in such a way that satisfies the considerations of all the involved partners.
Goren, S., Pierreval, Henri
openaire +2 more sources
Hybrid flow-shop scheduling with assembly operations
International Journal of Production Economics, 2001Abstract Hybrid scheduling for the production system including parts machining and assembly operations is studied. Several products of different kinds are ordered to be produced and parts for the products are manufactured in the flow-shop consisting of multiple machines.
openaire +1 more source
Analysis of a Heuristics for Scheduling Two-Stage Hybrid Flow Shop
2009 International Joint Conference on Computational Sciences and Optimization, 2009This paper focuses on the scheduling problem of minimizing the makespan for a given set of jobs in a two-stage hybrid flowshop environment. In each stage, there are identical parallel machines. We present a heuristic algorithm which extends a few classes of the heuristics for solving the problem with only one machine on the second stage.
Xie Xie, Lixin Tang
openaire +1 more source
A literature review on hybrid flow shop scheduling
International Journal of Advanced Operations Management, 2020Ömür Tosun +2 more
openaire +1 more source