A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays

DOI10.1007/978-3-540-77918-6_5zbMath1130.90020OpenAlexW2131385779MaRDI QIDQ5443372

A. A. Ageev

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_5

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Two-machine flowshop scheduling problem with coupled-operations

Cites Work

• Unnamed Item
• A heuristic for the two-machine open-shop scheduling problem with transportation times
• Approximation algorithms for UET scheduling problems with exact delays
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Shop Problems With Two Machines and Time Lags
• Approximation Algorithms for Scheduling Problems with Exact Delays

This page was built for publication: A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays