A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.

DOI10.1016/S0166-218X(00)00374-7zbMath1168.90449OpenAlexW2064096546MaRDI QIDQ5954096

Sergey Sevast'janov, K. N. Kashyrskikh, Chris N. Potts

Publication date: 30 January 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00374-7

zbMATH Keywords

SchedulingApproximation algorithmFlow shopRelease dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan ⋮ Optimal control of a two-server flow-shop network ⋮ Two-machine flowshop scheduling in a physical examination center ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
• Optimal two- and three-stage production schedules with setup times included
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates

This page was built for publication: A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.