Applications of max-plus algebra to flow shop scheduling problems

Abstract In this paper we consider applications of max-plus algebra to flow shop scheduling problems. Our aim is to show that max-plus algebra is useful for flow shop scheduling. We present two new solvable conditions in m -machine permutation flow shops using max-plus algebra. One of the conditions is found by considering a max-plus algebraic analogue of a proposition in linear algebra. The other is derived using a new framework, which associates a machine with a matrix and is the dual of the max-plus approach associating a job with a matrix by Bouquard, Lente, and Billaut (2006). The framework is the first one which can deal with non-permutation flow shop problems based on max-plus algebra. Moreover, using the framework, we provide new simple proofs of some known results.

[1]  Jerzy Kamburowski,et al.  On no-wait and no-idle flow shops with makespan criterion , 2007, Eur. J. Oper. Res..

[2]  Bernard Giffler.  Schedule algebra: A progress report , 1968 .

[3]  Jatinder N. D. Gupta.  Optimal schedules for special structure flowshops , 1975 .

[4]  Jerzy Kamburowski,et al.  More on three-machine no-idle flow shops , 2004, Comput. Ind. Eng..

[5]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling , 2018 .

[6]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[7]  Ludwig Elsner,et al.  On the power method in max algebra , 1999 .

[8]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[9]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[10]  M. Plus.  L'algèbre (max, +) et sa symétrisation ou l'algèbre des équilibres , 1990 .

[11]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[12]  J. Quadrat,et al.  A linear-system-theoretic view of discrete-event processes , 1983, The 22nd IEEE Conference on Decision and Control.

[13]  Geert Jan Olsder,et al.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[14]  Tae-Eog Lee.  Stable Earliest Starting Schedules for Periodic Job Shops: a Linear System Approach , 1994 .

[15]  Hans Schneider,et al.  Max-Balancing Weighted Directed Graphs and Matrix Scaling , 1991, Math. Oper. Res..

[16]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[17]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[18]  Jean-Louis Bouquard,et al.  Two-machine flow shop scheduling problems with minimal and maximal delays , 2006, 4OR.

[19]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[20]  B. Carré.  An Algebra for Network Routing Problems , 1971 .

[21]  鍋島 一郎,et al.  Notes on the Analytical Results in Flow Shop Scheduling : Part 2 , 1977 .

[22]  Claire Hanen,et al.  A Study of the Cyclic Scheduling Problem on Parallel Processors , 1995, Discret. Appl. Math..

[23]  R. A. Cuninghame-Green,et al.  Describing Industrial Processes with Interference and Approximating Their Steady-State Behaviour , 1962 .

[24]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[25]  C. Monma,et al.  A concise survey of efficiently solvable special cases of the permutation flow-shop problem , 1983 .

[26]  Francis Y. L. Chin,et al.  Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems , 1982, Math. Oper. Res..

[27]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[28]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[29]  Jean-Charles Billaut,et al.  Application of an optimization problem in Max-Plus algebra to scheduling problems , 2006, Discret. Appl. Math..

[30]  Wlodzimierz Szwarc.  Permutation flow‐shop theory revisited , 1978 .

[31]  Wlodzimierz Szwarc.  Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem , 1977, Oper. Res..