Flexible Flow Shop with Storage: Complexity and Optimisation Methods

Fung, J; Zinder, Y; Singh, G

Flexible Flow Shop with Storage: Complexity and Optimisation Methods

Fung, J

Zinder, Y

Singh, G

Permalink

Publication Type:: Conference Proceeding
Citation:: IFAC-PapersOnLine, 2016, 49 (12), pp. 237 - 242
Issue Date:: 2016-01-01

Closed Access

	Filename	Description	Size
	Published paper.pdf	Published version	398.56 kB		View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Fung, J https://orcid.org/0000-0001-7352-4321	en_US
dc.contributor.author	Zinder, Y https://orcid.org/0000-0003-2024-8129	en_US
dc.contributor.author	Singh, G	en_US
dc.date.issued	2016-01-01	en_US
dc.identifier.citation	IFAC-PapersOnLine, 2016, 49 (12), pp. 237 - 242	en_US
dc.identifier.uri	http://hdl.handle.net/10453/100404
dc.description.abstract	© 2016 The paper is concerned with a two-stage flexible flow shop with a buffer under the assumption that all operations have the same processing time and that each job can be processed on a machine only if a certain amount of buffer space is allocated to this job. The amount of buffer space to be allocated differs from job to job. The buffer is shared by all machines and has limited size. The objective function is the makespan. The application area includes supply chains which involve loading and unloading operations, and problems arising in computer systems with shared memory. It is proven that in general, the problem is NP-hard in the strong sense, but in the case of two-machines, it is solvable in polynomial-time. For the general case, several integer linear programming models are presented and compared by means of computational experiments. The presented integer linear programming models implement various ideas such as symmetry breaking constraints, knapsack type cutting planes and the results of the analysis of the structure of optimal schedules.	en_US
dc.relation.ispartof	IFAC-PapersOnLine	en_US
dc.relation.isbasedon	10.1016/j.ifacol.2016.07.606	en_US
dc.title	Flexible Flow Shop with Storage: Complexity and Optimisation Methods	en_US
dc.type	Conference Proceeding
utslib.citation.volume	12	en_US
utslib.citation.volume	49	en_US
utslib.for	010206 Operations Research	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access
pubs.issue	12	en_US
pubs.publication-status	Published	en_US
pubs.volume	49	en_US

Abstract:

© 2016 The paper is concerned with a two-stage flexible flow shop with a buffer under the assumption that all operations have the same processing time and that each job can be processed on a machine only if a certain amount of buffer space is allocated to this job. The amount of buffer space to be allocated differs from job to job. The buffer is shared by all machines and has limited size. The objective function is the makespan. The application area includes supply chains which involve loading and unloading operations, and problems arising in computer systems with shared memory. It is proven that in general, the problem is NP-hard in the strong sense, but in the case of two-machines, it is solvable in polynomial-time. For the general case, several integer linear programming models are presented and compared by means of computational experiments. The presented integer linear programming models implement various ideas such as symmetry breaking constraints, knapsack type cutting planes and the results of the analysis of the structure of optimal schedules.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/100404