Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop

DOI10.1007/s10288-020-00449-8zbMath1470.90002OpenAlexW3041020310MaRDI QIDQ2044553

Arianna Alfieri, Shuyu Zhou, Rosario Scatamacchia, Steef L. van de Velde

Publication date: 9 August 2021

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-020-00449-8

zbMATH Keywords

Lagrangian relaxationdynamic programmingflow shoptotal flow timesetup timeslot streaming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones

Cites Work

• Unnamed Item
• Unnamed Item
• Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop
• Batch scheduling on two-machine flowshop with machine-dependent setup times
• Scheduling a hybrid flowshop with batch production at the last stage
• Batching in single operation manufacturing systems
• Scheduling a batching machine
• Lot streaming with detached setups in three-machine flow shops
• Lot streaming in three-stage production processes
• Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups
• Flow shop scheduling with lot streaming
• Part batching and scheduling in a flexible cell to minimize setup costs
• Structural Properties of Lot Streaming in a Flow Shop
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• Flow-shop batch scheduling with identical processing-time jobs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Survey of Lagrangean Techniques for Discrete Optimization
• Basic Techniques for Lot Streaming
• Validation of subgradient optimization
• Lot streaming with variable sublots: an integer programming formulation
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Discrete Lot Streaming In Two-Machine Flow Shops

This page was built for publication: Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop