On-line and semi-online scheduling for flow shop problems on two machines

DOI10.1080/02331934.2011.622759zbMath1273.90088OpenAlexW2064017604MaRDI QIDQ2841141

No author found.

Publication date: 24 July 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2011.622759

zbMATH Keywords

algorithmschedulinglower boundflow shopon-line

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Online scheduling of ordered flow shops

Cites Work

• Approximation results for flow shop scheduling problems with machine availability constraints
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Optimal two- and three-stage production schedules with setup times included
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Unnamed Item

This page was built for publication: On-line and semi-online scheduling for flow shop problems on two machines