Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups
type: Item
instance of: scholarly article
title: Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups
zbMATH Open document ID: 1046.90025
DOI: 10.1023/A:1021942422161
author: Adar A. Kalir
author: Subhash C. Sarin
published in: Journal of Combinatorial Optimization
publication date: 2003-10-27T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1997338
zbMATH Keywords: lot streaming
zbMATH Keywords: flow-shop
zbMATH Keywords: optimization
MaRDI profile type: Publication
full work available at URL: a:1021942422161
OpenAlex ID: W2256179311
Recommended article: The lot-streaming problem in a flow shop with time adjustment
Recommended article: Lot streaming with variable sublots: an integer programming formulation
Recommended article: Flow shop scheduling with lot streaming
Recommended article: Approximation methods for discrete lot streaming in flow shops
Recommended article: Lot Streaming in Job-Shop Scheduling
Recommended article: Scheduling and lot streaming in flowshops with no-wait in process
Recommended article: An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem
Recommended article: Q4806815
Recommended article: Q4352233
description: scientific article; zbMATH DE number 1997338