Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
From MaRDI portal
Publication:6054756
DOI10.1002/nav.22097zbMath1525.90220OpenAlexW4313829758MaRDI QIDQ6054756
Publication date: 25 October 2023
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.22097
pseudo-polynomial time algorithmjust-in-time scheduling\( \mathcal{N}\mathcal{P} \)-hardnessdistributed flow-shop
Cites Work
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- The just-in-time scheduling problem in a flow-shop scheduling system
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Proportionate flow shop games
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- The distributed permutation flowshop scheduling problem
- Scheduling jobs with fixed start and end times
- Minimizing total weighted completion time in a proportionate flow shop
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- On the \(k\)-coloring of intervals
- Single machine scheduling to minimize the number of early and tardy jobs
- 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
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Open-shop batch scheduling with identical jobs
- Sequencing with Earliness and Tardiness Penalties: A Review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling unit processing time jobs on an m-machine flow-shop
- Minmax earliness-tardiness costs with unit processing time jobs
- Maximizing total early work in a distributed two‐machine flow‐shop
This page was built for publication: Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
