The just-in-time scheduling problem in a flow-shop scheduling system
From MaRDI portal
Publication:421784
DOI10.1016/j.ejor.2011.07.053zbMath1237.90097MaRDI QIDQ421784
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.053
complexity; pseudo-polynomial time algorithm; just-in-time scheduling; flow-shop; no-wait restriction
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs, Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs, An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem, Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system, A state-of-the-art survey on multi-scenario scheduling, A note: maximizing the weighted number of just-in-time jobs for a given job sequence, Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times, A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop, A note: minimizing maximum earliness on a proportionate flowshop, A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines, Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs, Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach, The proportionate flow shop total tardiness problem, 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, A survey on scheduling problems with due windows
Cites Work
- Finding the largest suborder of fixed width
- 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
- 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
- Minimizing total weighted completion time in a proportionate flow shop
- 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
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Open-shop batch scheduling with identical jobs
- Interval scheduling on identical machines
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Maximum weightk-independent set problem on permutation graphs
- Scheduling unit processing time jobs on an m-machine flow-shop
- Minmax earliness-tardiness costs with unit processing time jobs
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
