Approximating the 2-machine flow shop problem with exact delays taking two values

DOI10.1007/s10898-019-00775-0zbMath1442.90065arXiv1711.00081OpenAlexW2963657568WikidataQ128026758 ScholiaQ128026758MaRDI QIDQ2174271

Yanyan Li

Publication date: 21 April 2020

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.00081

zbMATH Keywords

approximation algorithmflow shopscheduling problemapproximation factorexact delaysinapproximability lower bound

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Interleaving two-phased jobs on a single machine
• 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
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Radar pulse interleaving for multi‐target tracking
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Approximation Algorithms for Scheduling Problems with Exact Delays

This page was built for publication: Approximating the 2-machine flow shop problem with exact delays taking two values