Filters








1,389 Hits in 4.2 sec

Page 817 of The Journal of the Operational Research Society Vol. 60, Issue 6 [page]

2009 The Journal of the Operational Research Society  
Lagrangian relaxation algorithms for real- time hybrid flowshop scheduling with finite intermediate buffers. J Opl Res Soc 57: 316-324.  ...  Multiprocessor task scheduling in multistage hybrid flow-shops: A simulated annealing approach.  ... 

Page 324 of The Journal of the Operational Research Society Vol. 57, Issue 3 [page]

2006 The Journal of the Operational Research Society  
Scheduling with finite capacity output buffers. Opns Res 46: S84-S97 Luh PB e7 a/ (1998). Job shop scheduling with group-dependent setups, finite buffers, and long time horizon.  ...  Heuristics for scheduling in a flow shop with multiple processors. Eur J Opl Res 113: 113-122 Moursli O and Pochet Y (2000). A branch-and-bound algorithm for the hybrid flowshop.  ... 

Optimization a new mathematical model of hybrid flow shop work order problem by the Genetic Algorithm

Nasser Shahsavari Pour, Hamed Asadi, Mansoor Kheradmand
2012 International Journal of Engineering & Technology  
Hybrid flow shop is one of the common production environments which lead to a significant decrease in production costs if it has a good and appropriate scheduling in production.  ...  Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task Processing.  ...  flexible flow shops with a finite planning horizon and limited intermediate buffers.  ... 
doi:10.14419/ijet.v1i3.147 fatcat:6qcsgwseergylmi6po7wirll2u

A review of scheduling problem and resolution methods in flexible flow shop

Tian-Soon Lee, Ying-Tai Loong
2019 International Journal of Industrial Engineering Computations  
The Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel machines.  ...  This paper gives a comprehensive guide for the reader with respect to future research work on the FFS scheduling problem.  ...  Cyclic hybrid flow-shop scheduling problem with machine setups.  ... 
doi:10.5267/j.ijiec.2018.4.001 fatcat:kiq2jjjsmzgtpoaudrq4qc7ndi

MULTICRITERIA HYBRID FLOW SHOP SCHEDULING PROBLEM: LITERATURE REVIEW, ANALYSIS, AND FUTURE RESEARCH

Marcia De Fatima Morais, Thays Josyane Perassoli Boiko, Leandro Dos Santos Coelho, Rony Peterson Da Rocha, Paulo Roberto PAraíso
2014 Independent Journal of Management & Production  
The literature points to several studies that focus the Hybrid Flow Shop scheduling problem with monocriteria functions.  ...  The goal of the study is to review and analyze the methods in order to solve the Hybrid Flow Shop production scheduling problem with multicriteria functions in the literature.  ...  M. (2006) Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case.  ... 
doi:10.14807/ijmp.v5i4.242 fatcat:hpnypjad65dylcdaoat72my4ju

MODELING, OPTIMISATION AND ANALYSIS OF RE-ENTRANT FLOWSHOP JOB SCHEDULING WITH FUZZY PROCESSING TIMES

L Ogunwolu, A Sosimi, S Obialo
2017 Nigerian Journal of Technology  
This paper presents a makespan minimization of -jobs -machines re-entrant flow shop scheduling problem (RFSP) under fuzzy uncertainties using Genetic Algorithm.  ...  Buffer First Serve (FBFS).  ...  line with service centers and finite capacity storage buffers .  ... 
doi:10.4314/njt.v36i3.21 fatcat:73dyj4uoc5cjda55auwkixsbbi

Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers

L Tang, H Xuan
2006 Journal of the Operational Research Society  
Scheduling with finite capacity output buffers. Opns Res 46: S84-S97 Luh PB e7 a/ (1998). Job shop scheduling with group-dependent setups, finite buffers, and long time horizon.  ...  Heuristics for scheduling in a flow shop with multiple processors. Eur J Opl Res 113: 113-122 Moursli O and Pochet Y (2000). A branch-and-bound algorithm for the hybrid flowshop.  ... 
doi:10.1057/palgrave.jors.2602033 fatcat:xd6r2gboc5h33mqsxvzufnrcse

A Literature Review of Energy Efficiency and Sustainability in Manufacturing Systems

Paolo Renna, Sergio Materi
2021 Applied Sciences  
., manufacturing system subclasses (single machine, flow shop, job shop, etc.) or the assembly line, the developed energy-saving policies and the implementation of the renewable energy sources in the studied  ...  In [174] the TNT policy was applied in a production line with finite buffer capacities.  ...  The blocking is typical in a flow shop system without buffers between machines or with limited and full intermediate buffers [63] .  ... 
doi:10.3390/app11167366 fatcat:utvylqdpdbgdppmdkiqcjyi57y

Lagrangian relaxation algorithms for hybrid flow-shop scheduling problems with limited buffers(TOTAL OPERATIONS MANAGEMENT)

Takashi IROHARA
2010 International journal of biomedical soft computing and human sciences  
Kleyivords lb,brid.17ow-shop scheduling Lagrangian relaxation aigorithm, Combinatorial optimtzahon.  ...  But most studies of HFS cleal with iclentical parallel machines which do not consider the machine abilities. 77iese are the motivation to study HFS scheduling problem with unrelatedparallel machine in  ...  . , (1998), Minimizing tardy jobs in a two-stage hybrid flowshop,  ... 
doi:10.24466/ijbschs.15.1_21 fatcat:63oyuxicfjca7k5wg7mlb3vka4

A simulation engine to support production scheduling using genetics-based machine learning [article]

H. Tamaki, V.V. Kryssanov, S. Kitamura
2006 arXiv   pre-print
This paper proposes an approach based on genetics-based machine learning (GBML) to treat the problem of flow shop scheduling.  ...  A pilot study is underway to evaluate the performance of the GBML technique in comparison with other methods (such as Johnson's algorithm and simulated annealing) while completing test examples.  ...  finite and infinite buffers.  ... 
arXiv:cs/0606021v1 fatcat:qwjc6p5gjjedhaxtlikwjp6rq4

Integral Approaches to Integrated Scheduling [chapter]

Ghada A. El Khayat
2007 Multiprocessor Scheduling, Theory and Applications  
Among these are material handling resources, buffers, route segments and intersections on a shop floor, labor, tools, pallets, fixtures and energy.  ...  Schedule Schedule performance Capacity status Scheduling constraints Shop status Job loading Data collection Shop orders, release dates Quantities, due dates AGV Automated Guided Vehicle Hier-Sch Hierarchical  ...  Glass et al. (1994) study the single product problem in flow shops, job shops and open shops.  ... 
doi:10.5772/5224 fatcat:6zpczkqfsrbtpheuu2cuc3jbpa

Page 668 of Mathematical Reviews Vol. , Issue 2001A [page]

2001 Mathematical Reviews  
(F-TOUR-INF; Tours) Les problemes d’ordonnancement de type flow-shop hybride: état de Vart. (English and French summaries) [Scheduling problems of hybrid flowshop type: state of the art] RO Oper.  ...  While the machine is working (an ON period), there is a deter- ministic net flow into the buffer.  ... 

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: A systematic literature review

Harpreet Singh, Jaspreet Singh Oberoi, Doordarshi Singh
2020 Reserche operationelle  
The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries.  ...  The scope of this paper is to identify the literature available on permutation and non-permutation flow shop scheduling with no-wait constraint.  ...  Based on this scheduling issue, the machine breakdown to the deteriorated scheduling and finite buffers is suggested.  ... 
doi:10.1051/ro/2020055 fatcat:t3g52lg2jzghfcljyig6ruu25a

An Enhanced Discrete Artificial Bee Colony Algorithm to Minimize the Total Flow Time in Permutation Flow Shop Scheduling with Limited Buffers

Guanlong Deng, Hongyong Yang, Shuning Zhang
2016 Mathematical Problems in Engineering  
This paper presents an enhanced discrete artificial bee colony algorithm for minimizing the total flow time in the flow shop scheduling problem with buffer capacity.  ...  First, the solution in the algorithm is represented as discrete job permutation to directly convert to active schedule.  ...  One special case in the permutation flow shop scheduling problem with limited buffers (LBPFSP) is with no buffer, and the problem is called the blocking flow shop scheduling problem (BPFSP).  ... 
doi:10.1155/2016/7373617 fatcat:jluhxgmwzrasvioduzxbfbttoq

Memetic algorithm used in a flow shop scheduling problem

Jorge Armando Ramos-Frutos, Didia Carrillo-Hernández, Alan David Blanco-Miranda, Heraclio García-Cervantes
2020 Journal Mathematical and Quantitative Methods  
Scheduling activities in flow shops involves generating a sequence in which the jobs must be processed.  ...  These results help to minimize processing times which impacts with the economics of the enterprise. Using the MA in an interface that helps the user to make a decisión about the Schedule of the Jobs.  ...   Flow Shop without and with Buffer.  ... 
doi:10.35429/jmqm.2020.6.4.8.14 fatcat:blipb7eccnalfp7qm5h35tzyqu
« Previous Showing results 1 — 15 out of 1,389 results