A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

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

[2]  Richard A. Dudek,et al.  Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

[3]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[4]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[5]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[6]  G. B. McMahon,et al.  Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[7]  Ichiro Nabeshima,et al.  ON THE BOUND OF MAKESPANS AND ITS APPLICATION IN M MACHINE SCHEDULING PROBLEM , 1967 .

[8]  Ashour Said.  A Branch-and-Bound Algorithm for Flow Shop Scheduling Problems , 1970 .

[9]  Wlodzimierz Szwarc.  Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem , 1973, Oper. Res..

[10]  Wlodzimierz Szwarc.  Mathematical aspects of the 3 × n job‐shop sequencing problem , 1974 .

[11]  S. S. Panwalkar,et al.  An improved branch and bound procedure for n × m flow shop problems , 1975 .

[12]  Kenneth R. Baker,et al.  A Comparative Study of Flow-Shop Algorithms , 1975, Oper. Res..

[13]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[14]  Wlodzimierz Szwarc,et al.  Johnson's approximate method for the 3 × n job shop problem , 1977 .

[15]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[16]  Uwe H. Suhl,et al.  An algorithm and efficient data structures for the binary knapsack problem , 1978 .

[17]  J. Carlier.  The one-machine sequencing problem , 1982 .

[18]  L. V. Wassenhove,et al.  Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[19]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[20]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

[21]  Alessandro Agnetis,et al.  Optimal two-machine scheduling in a flexible flow system , 1990, [1990] Proceedings. Rensselaer's Second International Conference on Computer Integrated Manufacturing.

[22]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[23]  Whm Henk Zijm,et al.  Scheduling a flexible machining centre , 1990 .

[24]  Helman I. Stern,et al.  Scheduling Parts in a Combined Production-transportation Work Cell , 1990 .

[25]  Hiroshi Kise,et al.  Optimal Scheduling for an Automated Two-Machine Manufacturing System. , 1991 .

[26]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[27]  Hiroshi Kise,et al.  ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER , 1991 .

[28]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[29]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .