On two-machine flow shop scheduling

DOI10.1007/s40305-014-0055-xzbMath1306.90047OpenAlexW2031058264MaRDI QIDQ489134

Wen-Chang Luo, Guo-Chuan Zhang, Lin Chen

Publication date: 27 January 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-014-0055-x

zbMATH Keywords

flow shoponline algorithmlinear time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Time bounds for selection
• Two-machine flow-shop scheduling with rejection
• Optimal two- and three-stage production schedules with setup times included
• A linear-time approximation algorithm for weighted matchings in graphs
• Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item

This page was built for publication: On two-machine flow shop scheduling