Results 221 to 230 of about 955 (265)
Some of the next articles are maybe not open access.
Hybrid flow shop scheduling with finite buffers
International Journal of Simulation and Process Modelling, 2018In this paper, the scheduling problem for hybrid flow shop is investigated with the consideration of the finite buffers. Different from the existing works which focus on the makespan minimisation under the constraints of given intermediate buffer sizes, this paper investigates how to decide the reasonable size of the intermediate buffer.
Zhonghua Han, Yue Sun, Xiaofu Ma, Zhe Lv
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
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
Hybrid flow-shop scheduling problems with multiprocessor task systems
European Journal of Operational Research, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oğuz, Ceyda +4 more
openaire +1 more source
Optimal Scheduling of a Two-stage Hybrid Flow Shop
Mathematical Methods of Operations Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haouari, Mohamed +2 more
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
Hybrid flow shop scheduling considering machine electricity consumption cost
International Journal of Production Economics, 2013Hybrid flow shop (HFS) scheduling has been extensively examined and the main objective has been to improve production efficiency. However, limited attention has been paid to the consideration of energy consumption with the advent of green manufacturing.
LI, XL +4 more
openaire +3 more sources
Hybrid bat algorithm for flow shop scheduling problems
International Journal of Mathematics in Operational Research, 2016In this paper, a hybrid bat algorithm is proposed to solve the permutation flow shop scheduling problems with makespan criterion. Developed for numerical optimisation, local search techniques are integrated into the bat algorithm to solve the flow shop problems.
Ömür Tosun, M.K. Marichelvam
openaire +1 more source
Scheduling Hybrid Flow Shop Containing Multi-Functional Machines
2006 International Conference on Computational Intelligence and Security, 2006Multi-functional machine (MFM) is often used in the current manufacturing system. In traditional way, the MFM was treated as single-functional machine (SFM), so the functions of the MFM might be wasted. When the multiple functions of an MFM are utilized to process jobs at several stages in a flow shop, the hybrid flow shop scheduling problem under the ...
Yanhai Hu, Dengzhe Ma, Feifan Ye
openaire +1 more source
Hybrid Genetic Algorithm for Flow Shop Scheduling Problem
2010 International Conference on Intelligent Computation Technology and Automation, 2010The flow shop scheduling problem (FSSP) is a NP-HARD combinatorial problem with strong industrial background. Among the meta-heuristics, genetic algorithms attracted a lot of attention. However, lacking the major evolution direction, the effectiveness of regular genetic algorithm is restricted.
Jianchao Tang +3 more
openaire +1 more source

