Flexible Flow Shop with Storage: Complexity and Optimisation Methods
Authors:
- Joey FungJFJoey Fung
- Yakov ZinderYZYakov Zinder
- Gaurav SinghGSGaurav Singh
- 1 January 2016
- journal article
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 49 (12) , 237-242
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Capacity planning in supply chains of mineral resourcesInformation Sciences, 2015
- Sequence optimization for media objects with due date constraints in multimedia presentations from digital librariesInformation Systems, 2013
- The variable neighborhood search for the two machine flow shop problem with a passive prefetchJournal of Applied and Industrial Mathematics, 2013
- Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applicationsJournal of Scheduling, 2011
- A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentationsComputers & Operations Research, 2009
- Cover and Pack Inequalities for (Mixed) Integer ProgrammingAnnals of Operations Research, 2005
- Scheduling unit — time tasks on flow — shops under resource constraintsAnnals of Operations Research, 1988
- Job shop scheduling with unit time operations under resource constraints and release datesDiscrete Applied Mathematics, 1987
- Facets of the knapsack polytopeMathematical Programming, 1975