Advanced search
Publication Cover
International Journal of Computer Integrated Manufacturing Volume 29, 2016 - Issue 7
Submit an article Journal homepage
384
Views
11
CrossRef citations to date
0
Altmetric
Original Articles

A hybrid meta-heuristic algorithm for flowshop robust scheduling under machine breakdown uncertainty

Mohammad FazayeliDepartment of Industrial Engineering, K.N.T. University of Technology, Tehran, IranCorrespondence[email protected]
,
Mohammad-Reza AleaghaDepartment of Industrial Engineering, K.N.T. University of Technology, Tehran, Iran
,
Reza BashirzadehDepartment of Industrial Engineering, K.N.T. University of Technology, Tehran, Iran
&
Rasoul ShafaeiDepartment of Industrial Engineering, K.N.T. University of Technology, Tehran, Iran
Pages 709-719 | Received 17 Nov 2013, Accepted 07 Jun 2015, Published online: 08 Mar 2016

References

  • Akturk, S., and E. Gorgulu. 1999. “Match-up Scheduling under a Machine Breakdown”. European Journal of Operational Research 112: 81–97.
  • Guo, B., and Y. Nonaka. 1999. “Rescheduling and Optimization of Schedules Considering Machine Failures”. Production Economics 60–61:503–513.
  • Hadda, H., N. Dridi, and S.H. Gabouj. 2010. “An Improved Heuristic for Two-machine Flowshop Scheduling with an Availability Constraint and Non-resumable Jobs”. Quarterly Journal of Operations Research 8: 87–99.
  • Lee, C. 1999. “Two-machine Flowshop Scheduling with Availability Constraints”. European Journal of Operational Research 114: 420–429.
  • Li, Z., and M. Ierapetritou. 2008. “Process Scheduling under Uncertainty: Review and Challenges”. Computers and Chemical Engineering 32: 715–727.
  • Liu, Q., S. Ullah, and C. Zhang. 2011. “An Improved Genetic Algorithm for Robust Permutation Flowshop Scheduling”. Advanced Manufacturing Technology 56: 345–354.
  • Mehta, S.V., and R. Uzsoy. 1999. “Predictable Scheduling of a Single Machine Subject to Breakdowns”. Computer Integrated Manufacturing 12 (1): 15–38.
  • Metropolis, N., A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller. 1953. “Equations of State Calculations by Fast Computing Machines”. Journal of Chemical Physics 21: 1087–1092.
  • Nawaz, M., E.E. Enscore, and I. Ham. 1983. “A Heuristic Algorithm for the m Machine n-Job Flowshop Sequencing Problem”. Management Science 11 (1): 91–95.
  • Nearchou, A.C. 2004. “A Novel Metaheuristic Approach for the Flowshop Scheduling Problem”. Engineering Applications of Artificial Intelligence 17: 289–300.
  • Ogbu, F.A., and D.K. Smith. 1989. “The Application of the Simulated Annealing Algorithm to the Solution of the n = m = Cmax Flowshop Problem”. Computers and Operations Research 17: 243–253.
  • Rajendran, C., and A.H. Ziegler. 2004. “Ant-colony Algorithms for Permutation Flowshop Scheduling to Minimize Makespan/Total Flowtime of Jobs”. European Journal of Operational Research 155: 426–438.
  • Reeves, C.R. 1995. “A Genetic Algorithm for Flowshop Sequencing”. Computers and Operations Research 22 (1): 5–13.
  • Ruiz, R., and T. Stutzle. 2007. “A Simple and Effective Iterated Greedy Algorithm for the Permutation Flowshop Scheduling Problem”. European Journal of Operational Research 177: 2033–2049.
  • Sabuncuoglu, I., and S. Goren. 2009. “Hedging Production Schedules against Uncertainty in Manufacturing Environment with a Review of Robustness and Stability Research”. Computer Integrated Manufacturing 22 (2): 138–157.
  • Safari, E., S. Sadjadi, and K. Shahanaghi. 2010. “Scheduling Flowshops with Condition-based Maintenance Constraint to Minimize Expected Makespan”. International Journal of Advanced Manufacturing Technology 46: 757–767.
  • Wu, C.W., K.N. Brown, and J.C. Beck. 2009. “Scheduling with Uncertain Durations: Modeling β-robust Scheduling with Constraints”. Computer Operation Research 36: 2348–2356.
  • Xu, X., Z. Xu, and X. Gu. 2011. “An Asynchronous Genetic Local Search Algorithm for the Permutation Flowshop Scheduling Problem with total Flowtime Minimization”. Expert Systems with Applications 38: 7970–7979.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.