Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
type: Item
instance of: scholarly article
title: Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
zbMATH Open document ID: 1470.90002
author: Arianna Alfieri
author: Shuyu Zhou
author: Rosario Scatamacchia
author: Steef van de Velde
published in: 4OR
publication date: 2021-08-09T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7379920
zbMATH Keywords: lot streaming
zbMATH Keywords: setup times
zbMATH Keywords: flow shop
zbMATH Keywords: total flow time
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: s10288-020-00449-8
OpenAlex ID: W3041020310
cites work: Part batching and scheduling in a flexible cell to minimize setup costs
cites work: Batch scheduling on two-machine flowshop with machine-dependent setup times
cites work: Lot streaming with variable sublots: an integer programming formulation
cites work: Scheduling a batching machine
cites work: Lot streaming with detached setups in three-machine flow shops
cites work: Discrete Lot Streaming In Two-Machine Flow Shops
cites work: Q4949162
cites work: Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop
cites work: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4178782
cites work: Structural properties of lot streaming in a flow shop
cites work: Lot streaming in three-stage production processes
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Validation of subgradient optimization
cites work: Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups
cites work: Flow-shop batch scheduling with identical processing-time jobs
cites work: Flow shop scheduling with lot streaming
cites work: Batching in single operation manufacturing systems
cites work: A Survey of Lagrangean Techniques for Discrete Optimization
cites work: Basic Techniques for Lot Streaming
cites work: Scheduling a hybrid flowshop with batch production at the last stage
DOI: 10.1007/S10288-020-00449-8
description: scientific article; zbMATH DE number 7379920