Minimizing functions of infeasibilities in a two-machine flow shop
From MaRDI portal
Publication:1969868
DOI10.1016/S0377-2217(99)00038-7zbMath0959.90024OpenAlexW1963905679MaRDI QIDQ1969868
Publication date: 19 March 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00038-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A faster algorithm for the maximum weighted tardiness problem
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- Variants of the two machine flow shop problem connected with factorization of matrix functions
- Factorization and job scheduling: A connection via companion based matrix functions
- Optimal two- and three-stage production schedules with setup times included
- Minimizing Total Tardiness on One Machine is NP-Hard
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On non-permutation solutions to some two machine flow shop scheduling problems
- Reducibility among Combinatorial Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
