Approximation Algorithms for Scheduling Problems with Exact Delays

DOI10.1007/11970125_1zbMath1129.90316OpenAlexW1867965047MaRDI QIDQ5443504

Alexander V. Kononov, A. A. Ageev

Publication date: 21 February 2008

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

Full work available at URL: https://doi.org/10.1007/11970125_1

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (11)

Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability ⋮ Approximating the 2-machine flow shop problem with exact delays taking two values ⋮ Approximation algorithms for coupled task scheduling minimizing the sum of completion times ⋮ Scheduling coupled-operation jobs with exact time-lags ⋮ A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays ⋮ Coupled task scheduling with exact delays: literature review and models ⋮ Minimizing total completion time in two-machine flow shops with exact delays ⋮ Two machines flow shop with reentrance and exact time lag ⋮ A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays ⋮ Two-machine flowshop scheduling problem with coupled-operations ⋮ Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays

This page was built for publication: Approximation Algorithms for Scheduling Problems with Exact Delays