A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
From MaRDI portal
Publication:2230732
Recommendations
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
- Two-machine flow shops with an optimal permutation schedule under a storage constraint
- Flow shop scheduling problems under machine-dependent precedence constraints
- Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics
- Two-machine flow shop scheduling problems with no-wait jobs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A complete 4-parametric complexity classification of short shop scheduling problems
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
- Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
- Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
- Optimal two- and three-stage production schedules with set-up time included
- Permutation schedules for a two-machine flow shop with storage
- Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications
- Scheduling algorithms
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling. Theory, algorithms, and systems.
- Simple heuristics for scheduling with limited intermediate storage
- The variable neighborhood search for the two machine flow shop problem with a passive prefetch
Cited in
(4)- Maximizing total early work in a distributed two‐machine flow‐shop
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
- Two-machine flow shops with an optimal permutation schedule under a storage constraint
- An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements
This page was built for publication: A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230732)
