An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
From MaRDI portal
Publication:398866
DOI10.1007/s10951-013-0320-6zbMath1297.90039OpenAlexW2014687183MaRDI QIDQ398866
Huajun Tang, Amir Elalouf, Eugene Levner
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0320-6
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ Improving the solution complexity of the scheduling problem with deadlines: A general technique ⋮ A note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ Maximizing Throughput in Flow Shop Real-Time Scheduling ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ On the parameterized tractability of the just-in-time flow-shop scheduling problem
Cites Work
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Fast approximation algorithm for job sequencing with deadlines
- An improved FPTAS for Restricted Shortest Path.
- Single machine scheduling to minimize the number of early and tardy jobs
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Approximation Schemes for the Restricted Shortest Path Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A simple efficient approximation scheme for the restricted shortest path problem
- Unnamed Item
