A two-stage flowshop scheduling with limited buffer storage

Asia-Pacific Journal of Operational Research

Volumn 26, Issue 4, 2009, Pages 503-522

  Su, Ling Huey ^a,b   Yang, Dar Li ^b   Chou, Hou Kuan ^a  

^a CHUNG YUAN CHRISTIAN UNIVERSITY   (Taiwan)

^b NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

Batch machine; Discrete machine; Flowshop; Limited buffer storage

Indexed keywords

BATCH MACHINE; BATCH MACHINES; BRANCH AND BOUNDS; DISCRETE MACHINE; FLOW-SHOP SCHEDULING; FLOW-SHOPS; FLOWSHOP; INPUT BUFFERS; LIMITED BUFFER STORAGE; LIMITED BUFFERS; MAKESPAN MINIMIZATION; OBJECTIVE FUNCTIONS; TWO STAGE;

HEURISTIC METHODS;

BUFFER STORAGE;

EID: 70350094010     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595909002328     Document Type: Article

References (12)

1. Agnetis, A, D Pacciarelli and F Rossi (1997). Batch scheduling in two-machine flow shop with limited buffer. Discrete Applied Mathematics, 72, 243-260.
2. Agnetis, A, F Rossi and G Gristina (1998). An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer. Naval Research Logistics, 45, 141-164.
3. Ahmadi, JH, RH Ahmadi S Dasu and CS Tang (1992). Batching and scheduling jobs on batch and discrete processors. Operations Research, 39(4), 750-763.
4. Dutta, SK and AA Cunningham (1975). Sequencing two-machine flowshops with finite intermediate storage. Management Science, 21, 989-996.
5. Garey, M. R. and D. S. Johnson (1979). Computers and Intractability. A Guide to the Theory of NP- Completeness. San Francisco: Freeman.
6. Leisten, R (1990). Flow shop sequencing problems with limited buffer storage. International Journal of Production Research, 28, 2085-2100.
7. Nowicki, E (1999). The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research, 116, 205-219.
8. Papadimitriou, CH and PC Kanellakis (1980). Flow shop scheduling with limited temporary storage. Journal of the Association for Computing Machinery, 27, 533-549.
9. Pranzo, M (2004). Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. European Journal of Operational Research, 153, 581-592.
10. Reddi SS (1976). Sequencing with finite intermediate storage. Management Science, 23(2), 216-217.
11. Ryu, JH and EN Pistikopoulos (2007). A novel approach to scheduling of zero-wait batch processes under processing time variations. Computers & Chemical Engineering, 31, 101-106.
12. Sung, CS and YH Kim (2002). Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Computers & Operations Research, 29, 275-294.