- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 928312, 20 pages
doi:10.1155/2012/928312
Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs
1School of Mechanical Engineering, Southwest Jiaotong University, Chengdu 610031, China
2School of Mechanical Engineering and Automation, Xihua University, Chengdu 610039, China
Received 20 February 2012; Revised 27 April 2012; Accepted 8 May 2012
Academic Editor: Jung-Fa Tsai
Copyright © 2012 Wenming Cheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
How to Cite this Article
Wenming Cheng, Peng Guo, Zeqiang Zhang, Ming Zeng, and Jian Liang, “Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs,” Mathematical Problems in Engineering, vol. 2012, Article ID 928312, 20 pages, 2012. doi:10.1155/2012/928312