Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: flowshop
Found
221 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
2002,
Rajendran Chandrasekharan
Most studies on scheduling in manufacturing systems using dispatching rules deal with...
Adaptive scheduling of batch servers in flow shops
2002,
Zee D.J. Van Der
Batch servicing is a common way of benefiting from economies of scale in manufacturing...
Nonpreemptive flowshop scheduling with machine dominance
2002,
Vlach Milan
Flowshop scheduling deals with processing a set of jobs through a set of machines,...
Solving hybrid flow shop problem using energetic reasoning and global operations
2001,
Gupta Jatinder N.D.
This paper shows that the use of satisfiability tests and time-bound adjustments based...
A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots
2001,
Sarin Subhash C.
In this paper, we consider the lot-streaming problem of sequencing a set of batches,...
Heuristic algorithms for the two-machine flowshop with limited machine availability
2001,
Schmidt Gnter
The paper studies a flowshop scheduling problem where machines are not available in...
Lot-streaming in a multi-stage flow-shop with setup time
2001,
Xie Qi
For the lot-streaming problem in a multi-stage flow-shop, the majority of the research...
Two-machine flow shops with limited machine availability
2002,
Kubiak Wieslaw
This paper studies a flow shop where machines have some periods of limited...
A cut-tree-based approach for clustering machine cells in the bidirectional linear flow layout
2001,
Lee Shine-Der
This paper considers the joint cell clustering-layout problem where machine cells are...
The asymptotic convergence of some flow-shop scheduling heuristics
2001,
Portougal Victor
Heuristics are often used to provide solutions for flow-shop scheduling problems. The...
Exact distribution of the makespan in a two machines flow shop with two kinds of jobs
2001,
Baptiste Pierre
This paper deals with the no-delay permutation flow shop with two machines and two...
A modification to the CGPS algorithm for three-machine flow shop scheduling
2001,
Tang Hui-Chin
In this paper, the three-machine flow shop scheduling (3FSS) with the objective of...
Scheduling the fabrication and assembly of components in a two-machine flowshop
1999,
Cheng T.C. Edwin
In this paper we study the problem of scheduling the fabrication and assembly of...
A new lower bound for the flow shop group scheduling problem
2001,
Schaller Jeffrey
This paper presents a new lower bound that is used to evaluate nodes in a branch and...
The two-machine stochastic flowshop problem with arbitrary processing time distributions
1999,
Elmaghraby S.E.
We treat the two-machine flowshop problem with the objective of minimizing the...
Lot streaming and scheduling multiple products in two-machine no-wait flowshops
1999,
Sriskandarajah C.
We consider the problem of minimizing makespan in two-machine no-wait flowshops with...
Transfer batch scheduling for a two-matching flow shop with attached and separate setup times
2001,
Kim Joong-Soon
This paper considers the transfer batch scheduling problem for a two-machine flow shop...
The flow shop problem with a server
2000,
Su Chunjie
The classic flow shop problem is widely researched. In this paper, the flowshop...
Heuristic algorithms for the flowshop scheduling problem
2000,
Feng Yuncheng
The flowshop scheduling problem is a well-known NP-hard problem. In this paper we...
Lot streaming with attached setups in three-machine flow shops
1998,
Steiner G.
Lot streaming is the process of splitting a job or lot to allow overlapping between...
Robust scheduling of a two-machine flow shop with uncertain processing times
2000,
Kouvelis P.
This paper focuses on manufacturing environments where job processing times are...
NP-hardness of some special cases of the three-machine flow-shop problem
2000,
Liu Zhaohui
In this paper, the authors investigate the computational complexity of some special...
Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
2001,
Formanowicz P.
The scheduling problems studied in this paper concern a two-machine no-wait flow shop...
New block properties for the permutation flow shop problem with application in tabu search
2001,
Grabowski Jozef
This paper deals with the classic flow-shop scheduling problem with the make-span...
First Page
4
5
6
7
8
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers