Flexible flow shop with dedicated buffers
Authors:
- Andreas ErnstAEAndreas Ernst
- Joey FungJFJoey Fung
- Gaurav SinghGSGaurav Singh
- Yakov ZinderYZYakov Zinder
- 1 May 2019
- journal article
- conference paper
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 261, 148-163
Abstract
No abstract availableKeywords
This 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
- 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
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935