Two-machine flow shop scheduling problem under linear constraints
From MaRDI portal
Publication:2180171
DOI10.1007/978-3-030-36412-0_32zbMATH Open1442.90083OpenAlexW2992392095MaRDI QIDQ2180171FDOQ2180171
Authors: Kameng Nip, Zhenbo Wang 
Publication date: 13 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36412-0_32
Recommendations
- Scheduling under linear constraints
- scientific article; zbMATH DE number 4010197
- Two-machine flow shop scheduling with convex resource consumption functions
- A two-machine flow shop scheduling problem with controllable job processing times
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (11)
- Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
- Flow shop non-idle scheduling and resource-constrained scheduling
- Variants of the two machine flow shop problem connected with factorization of matrix functions
- Scheduling under linear constraints
- Title not available (Why is that?)
- Related machine scheduling with machine speeds satisfying linear constraints
- A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
- Computational complexity and algorithms for two scheduling problems under linear constraints
- On the NP-hardness of two scheduling problems under linear constraints
- Inverse scheduling: Two-machine flow-shop problem
This page was built for publication: Two-machine flow shop scheduling problem under linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180171)
