Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan

References

• Blum , C . 2005 . Beam-ACO Hybridizing Ant Colony Optimization with Beam Search: An Application to Open Shop Scheduling . Computer & Operations Research , 32 : 1565 – 1591 .
   Web of Science ®Google Scholar
• Bramel , J and Simchi-Levi , D . 1997 . The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management , New York : Springer .
   Google Scholar
• Bräsel , H , Tautenhahn , T and Werner , F . 1993 . Constructive Heuristic Algorithms for the Open-shop Problem . Computing , 51 : 95 – 110 .
   Web of Science ®Google Scholar
• Brucker , P , Hurink , J , Jurisch , B and Wöstmann , B . 1997 . A Branch & Bound Algorithm for the Open-shop Problem . Discrete Applied Mathematics , 76 : 43 – 59 .
   Web of Science ®Google Scholar
• Chen , B , Potts , CN and Woeginger , GJ . 1998 . “ A Review of Machine Scheduling: Complexity, Algorithms and Approximability ” . In Handbook of Combinatorial Optimization , Edited by: Du , D-Z and Pardalos , P . 21 – 169 . London : Kluwer Academic Publishers .
   Google Scholar
• Chen , B and Strusevich , VA . 1993 . Approximation Algorithms for Three-machine Open Shop Scheduling . ORSA Journal on Computing , 5 : 321 – 326 .
   Google Scholar
• Cheng , M , Wang , G and He , L . 2009 . Parallel Machine Scheduling Problems with Proportionally Deteriorating Jobs . International Journal of Systems Science , 40 : 53 – 57 .
   Web of Science ®Google Scholar
• Chen , T , Huang , J , Zheng , Z and Xiang , L . 2008 . A Practical Dynamic Frequency Scaling Scheduling Algorithm for General Purpose Embedded Operating System . in Proceedings of the 2008 2nd International Conference on Future Generation Communication and Networing , 2 : 213 – 216 . IEEE Computer Society.
   Google Scholar
• Colak , S and Agarwal , A . 2005 . Non-greedy Heuristics and Augmented Neural Networks for the Open-shop Scheduling Problem . Naval Research Logistics , 52 : 631 – 644 .
   Google Scholar
• Dror , M . 1992 . Openshop Scheduling with Machine Dependent Processing Times . Discrete Applied Mathematics , 39 : 197 – 205 .
   Web of Science ®Google Scholar
• Dorndorf , U , Pesch , E and Phan-Huy , T . 2001 . Solving the Open Shop Scheduling Problem . Journal of Scheduling , 4 : 157 – 174 .
   Web of Science ®Google Scholar
• Gonzalez , T and Sahni , S . 1976 . Open Shop Scheduling to Minimize Finish Time . Journal of the Association for Computing , 23 : 665 – 679 .
   Web of Science ®Google Scholar
• Graham , RL , Lawler , EL , Lenstra , JK and Rinnooy Kan , AHG . 1979 . Optimization and Approximation in Deterministic Machine Sequencing and Scheduling: a Survey . Annals of Discrete Mathematics , 5 : 287 – 326 .
   Google Scholar
• Huang , S , Batta , R and Nagi , R . 2003 . Variable Capacity Sizing and Selection of Connections in a Facility Layout . IIE Transactions , 35 : 49 – 59 .
   Web of Science ®Google Scholar
• Kumar , V , Kumar , S , Tiwari , MK and Chan , FTS . 2008 . Performance Evaluation of FMS Under Uncertain and Dynamic Situations . Journal of Engineering Manufacture , 222 : 915 – 934 .
   Google Scholar
• Lawler , EL , Lenstra , JK , Rinnooy Kan , AHG and Shmoys , DB . 1993 . “ Sequencing and Scheduling: Algorithms and Complexity ” . In Handbook in Operations Research and Management Science, Logistics of Production and Inventory , Edited by: Graves , SC , Rinnooy Kan , AHG and Zipkin , P . Vol. 4 , 445 – 522 . Amsterdam : North-Holland .
   Google Scholar
• Lian , Z , Gu , X and Jiao , B . 2008 . A Novel Particle Swarm Optimization Algorithm for Permutation Flow-shop Scheduling to Minimize Makespan . Chaos, Solitons and Fractals , 35 : 851 – 861 .
   Web of Science ®Google Scholar
• Mishra , N , Choudhary , AK and Tiwari , MK . 2008 . Modelling the Planning and Scheduling across the Outsourcing Supply Chain: A Chaos Based Fast Tabu-SA Approach . International Journal of Production Research , 46 : 3683 – 3715 .
   Web of Science ®Google Scholar
• Pinedo , M . 2002 . Scheduling: Theory, Algorithms and Systems, , 2nd , New Jersey : Prentice-Hall .
   Google Scholar
• Sevastianov , SV and Woeginger , GJ . 1998 . Makespan Minimization in Open Shops: a Polynomial Time Approximation Scheme . Mathematical Programming , 82 : 191 – 198 .
   Web of Science ®Google Scholar
• Sha , DY and Hsu , C-Y . 2008 . A New Particle Swarm Optimization for the Open Shop Scheduling Problem . Computers & Operations Research , 35 : 3243 – 3261 .
   Web of Science ®Google Scholar
• Strusevich , VA . 1998 . A Greedy Open Shop Heuristic with Job Priorities . Annals of Operations Research , 83 : 253 – 270 .
   Google Scholar
• Williamson , DP , Hall , LA , Hoogeveen , JA , Hurkens , CAJ , Lenstra , JK , Sevast’janov , SV and Shmoys , DB . 1997 . Short Shop Schedules . Operations Research , 45 : 288 – 294 .
   Web of Science ®Google Scholar
• Zobolas , GI , Tarantilis , CD and Ioannou , G . 2009 . Solving the Open Shop Scheduling Problem via a Hybrid Genetic-variable Neighbourhood Search Algorithm . Cybernetics and Systems Archive , 40 : 259 – 285 .
   Web of Science ®Google Scholar