Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
From MaRDI portal
Publication:2434268
DOI10.1007/s10951-010-0204-yzbMath1280.90070OpenAlexW1965928330MaRDI QIDQ2434268
Dvir Shabtay, Yaron Bensoussan
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0204-y
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem ⋮ Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times ⋮ 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 ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ A note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ Maximizing Throughput in Flow Shop Real-Time Scheduling ⋮ On the parameterized tractability of the just-in-time flow-shop scheduling problem ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling ⋮ Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
Cites Work
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- Scheduling jobs with fixed start and end times
- The maximum k-colorable subgraph problem for chordal graphs
- On chain and antichain families of a partially ordered set
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Maximum \(k\)-covering of weighted transitive graphs with applications
- On the \(k\)-coloring of intervals
- Single machine scheduling to minimize the number of early and tardy jobs
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- Interval scheduling on identical machines
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- Sequencing with Earliness and Tardiness Penalties: A Review
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Maximum weightk-independent set problem on permutation graphs
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
