Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop

DOI10.1007/S10898-015-0298-ZzbMath1354.90047OpenAlexW2464214333MaRDI QIDQ330269

Sanchit Singh, Ming Cheng, Sarin, Subhash C.

Publication date: 25 October 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0298-z

zbMATH Keywords

schedulinghybrid flow shoplot streaming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

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

Cites Work

• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
• The hybrid flow shop scheduling problem
• Single-job lot streaming in \(m - 1\) two-stage hybrid flowshops
• Two-Stage, Hybrid Flowshop Scheduling Problem
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop

This page was built for publication: Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop