Applications of max-plus algebra to flow shop scheduling problems

DOI10.1016/j.dam.2018.03.045zbMath1403.90340OpenAlexW2798028815WikidataQ130040134 ScholiaQ130040134MaRDI QIDQ1671348

Katsuhiro Nishinari, Susumu Kubo

Publication date: 6 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.045

zbMATH Keywords

schedulingflow shopmax-plus algebralinear algebra

Mathematics Subject Classification ID

Related Items (3)

An improved algorithm for finding the generators of the solution space for \(A\otimes \mathbf{x}\ge \mathbf{x} \) ⋮ Approximately global optimal control for max-plus linear systems and its application on load distribution ⋮ An algebraic expression of the number partitioning problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On no-wait and no-idle flow shops with makespan criterion
• Two-machine flow shop scheduling problems with minimal and maximal delays
• A study of the cyclic scheduling problem on parallel processors
• On the power method in max algebra
• Application of an optimization problem in max-plus algebra to scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• Permutation flow-shop theory revisited
• A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
• Max-Balancing Weighted Directed Graphs and Matrix Scaling
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems
• Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
• Optimal schedules for special structure flowshops
• Technical Note—Three-Stage Flow-Shops with Recessive Second Stage
• Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• An Algebra for Network Routing Problems
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Scheduling

This page was built for publication: Applications of max-plus algebra to flow shop scheduling problems