On the parameterized tractability of the just-in-time flow-shop scheduling problem
From MaRDI portal
Publication:2294891
Abstract: Since its development in the early 90's, parameterized complexity has been widely used to analyze the tractability of many NP-hard combinatorial optimization problems with respect to various types of problem parameters. While the generic nature of the framework allows the analysis of any combinatorial problem, the main focus along the years was on analyzing graph problems. In this paper we diverge from this trend by studying the parameterized complexity of Just-In-Time (JIT) flow-shop scheduling problems. Our analysis focuses on the case where the number of due dates is considerably smaller than the number of jobs, and can thus be considered as a parameter. We prove that the two-machine problem is W[1]-hard with respect to this parameter, even if all processing times on the second machine are of unit length, while the problem is in XP even for a parameterized number of machines. We then move on to study the tractability of the problem when combining the different number of due dates with either the number of different weights or the number of different processing times on the first machine. We prove that in both cases the problem is fixed-parameter tractable for the two machine case, and is W[1]-hard for three or more machines.
Recommendations
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- The just-in-time scheduling problem in a flow-shop scheduling system
- Scheduling and fixed-parameter tractability
- Scheduling and fixed-parameter tractability
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Cites work
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Fundamentals of parameterized complexity
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- On the \(k\)-coloring of intervals
- On the parametric complexity of schedules to minimize tardy tasks.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized algorithms
- Parameterized complexity of machine scheduling: 15 open problems
- Scheduling and fixed-parameter tractability
- Scheduling jobs with fixed start and end times
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Scheduling two competing agents when one agent has significantly fewer jobs
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling to minimize the number of early and tardy jobs
- The just-in-time scheduling problem in a flow-shop scheduling system
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
Cited in
(14)- The just-in-time scheduling problem in a flow-shop scheduling system
- A multivariate complexity analysis of the material consumption scheduling problem
- scientific article; zbMATH DE number 2186533 (Why is no real title available?)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time
- Maximizing total early work in a distributed two‐machine flow‐shop
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- Parameterized complexity of a coupled-task scheduling problem
- Scheduling and fixed-parameter tractability
- A state-of-the-art survey on multi-scenario scheduling
- A new perspective on single-machine scheduling problems with late work related criteria
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- Equitable scheduling on a single machine
- Lagrangian bounds for just-in-time job-shop scheduling
This page was built for publication: On the parameterized tractability of the just-in-time flow-shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294891)
