Applications of max-plus algebra to flow shop scheduling problems
From MaRDI portal
Publication:1671348
Recommendations
- Application of an optimization problem in max-plus algebra to scheduling problems
- Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
- A max-plus algebra approach for generating non-delay schedule
- scientific article; zbMATH DE number 2221681
- Max Plus Algebra, Optimization and Game Theory
Cites work
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- A study of the cyclic scheduling problem on parallel processors
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- An Algebra for Network Routing Problems
- Application of an optimization problem in max-plus algebra to scheduling problems
- Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- scientific article; zbMATH DE number 4147882 (Why is no real title available?)
- scientific article; zbMATH DE number 3786461 (Why is no real title available?)
- scientific article; zbMATH DE number 3786527 (Why is no real title available?)
- scientific article; zbMATH DE number 627763 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Max-Balancing Weighted Directed Graphs and Matrix Scaling
- On no-wait and no-idle flow shops with makespan criterion
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- On the power method in max algebra
- Optimal schedules for special structure flowshops
- Optimal two- and three-stage production schedules with set-up time included
- Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Permutation flow-shop theory revisited
- Scheduling. Theory, algorithms, and systems.
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
- Technical Note—Three-Stage Flow-Shops with Recessive Second Stage
- Two-machine flow shop scheduling problems with minimal and maximal delays
Cited in
(11)- An improved algorithm for finding the generators of the solution space for \(A\otimes \mathbf{x}\ge \mathbf{x} \)
- An algebraic expression of the number partitioning problem
- Application of an optimization problem in max-plus algebra to scheduling problems
- A max-plus algebra approach for generating non-delay schedule
- Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
- Approximately global optimal control for max-plus linear systems and its application on load distribution
- Locally and globally optimal solutions of global optimisation for max-plus linear systems
- Theory and methodology of time-dependent scheduling: past, present and future
- Solving two-sided system of equations in max-plus algebra
- A specific minimax programming with the max-plus inequalities constraints
- Composition orderings for linear functions and matrix multiplication orderings
This page was built for publication: Applications of max-plus algebra to flow shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671348)
