148
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

A discrete electromagnetism-like mechanism for parallel machine scheduling under a grade of service provision

, , &
Pages 3149-3163 | Received 01 Apr 2016, Accepted 14 Nov 2016, Published online: 04 Dec 2016

References

  • Ali, M. M., and M. Golalikhani. 2010. “An Electromagnetism-like Method for Nonlinearly Constrained Global Optimization.” Computers & Mathematics with Applications 60 (8): 2279–2285.10.1016/j.camwa.2010.08.018
  • Alidaee, B., and D. Rosa. 1997. “Scheduling Parallel Machines to Minimize Total Weighted and Unweighted Tardiness.” Computers & Operations Research 24 (8): 775–788.10.1016/S0305-0548(96)00080-9
  • Birbil, S. I., and S. C. Fang. 2003. “An Electromagnetism-like Mechanism for Global Optimization.” Journal of Global Optimization 25 (3): 263–282.10.1023/A:1022452626305
  • Birbil, S. I., S. C. Fang, and R. L. Sheu. 2004. “On the Convergence of a Population-based Global Optimization Algorithm.” Journal of Global Optimization 30 (2–3): 301–318.
  • Chang, P. C., S. H. Chen, and C. Y. Fan. 2009. “A Hybrid Electromagnetism-like Algorithm for Single Machine Scheduling Problem.” Expert Systems with Applications 36 (2): 1259–1267.10.1016/j.eswa.2007.11.050
  • Chao, C. W., and C. J. Liao. 2012. “A Discrete Electromagnetism-like Mechanism for Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup times.” Applied Soft Computing 12 (9): 3079–3087.10.1016/j.asoc.2012.05.017
  • Cheng, R., M. Gen, and T. Tozawa. 1995. “Minmax Earliness/Tardiness Scheduling in Identical Parallel Machine System Using Genetic Algorithms.” Computers & Industrial Engineering 29 (1–4): 513–517.10.1016/0360-8352(95)00126-L
  • Debels, D., B. D. Reyck, R. Leus, and M. Vanhoucke. 2006. “A Hybrid Scatter Search/Electromagnetism Meta-Heuristic for Project Scheduling.” European Journal of Operational Research 169 (2): 638–653.10.1016/j.ejor.2004.08.020
  • Gao, L., C. Zhang, X. Li, and L. Wang. 2014. “Discrete Electromagnetism-like Mechanism Algorithm for Assembly Sequences Planning.” International Journal of Production Research 52 (12): 3485–3503.10.1080/00207543.2013.867087
  • Garcia-Villoria, A., and P. R. Moreno. 2010. “Solving the Response Time Variability Problem by Means of the Electromagnetism-like Mechanism.” International Journal of Production Research 48 (22): 6701–6714.10.1080/00207540902862545
  • Glass, C. A., and H. Kellerer. 2007. “Parallel Machine Scheduling with Job Assignment Restrictions.” Naval Research Logistics 54 (3): 250–257.10.1002/(ISSN)1520-6750
  • Guan, X., X. Dai, B. Qiu, and J. Li. 2012. “A Revised Electromagnetism-like Mechanism for Layout Design of Reconfigurable Manufacturing System.” Computers & Industrial Engineering 63 (1): 98–108.10.1016/j.cie.2012.01.016
  • Hamidinia, A., S. Khakabimamaghani, M. M. Mazdeh, and M. Jafari. 2012. “A Genetic Algorithm for Minimizing Total Tardiness/Earliness of Weighted Jobs in a Batched Delivery System.” Computers & Industrial Engineering 62 (1): 29–38.10.1016/j.cie.2011.08.014
  • Hwang, H. C., S. Y. Chang, and K. Lee. 2004. “Parallel Machine Scheduling under a Grade of Service Provision.” Computers & Operations Research 31 (12): 2055–2061.10.1016/S0305-0548(03)00164-3
  • Ji, M., and T. C. E. Cheng. 2008. “An FPTAS for Parallel-machine Scheduling under a Grade of Service Provision to Minimize Makespan.” Information Processing Letters 108 (4): 171–174.10.1016/j.ipl.2008.04.021
  • Liaw, C. F., Y. K. Lin, C. Y. Cheng, and M. C. Chen. 2003. “Scheduling Unrelated Parallel Machines to Minimize Total Weighted Tardiness.” Computers & Operations Research 30 (12): 1777–1789.10.1016/S0305-0548(02)00105-3
  • Lin, Y. K., M. E. Pfund, and J. W. Fowler. 2011. “Heuristics for Minimizing Regular Performance Measures in Unrelated Parallel Machine Scheduling Problems.” Computers & Operations Research 38 (6): 901–916.10.1016/j.cor.2010.08.018
  • Lu, X., and Z. Liu. 2013. “Semi-Online Scheduling Problems on Two Uniform Machines under a Grade of Service Provision.” Theoretical Computer Science 489–490: 58–66.10.1016/j.tcs.2013.04.013
  • Ou, J., J. Y. T. Leung, and C. L. Li. 2008. “Scheduling Parallel Machines with Inclusive Processing Set Restrictions.” Naval Research Logistics 55 (4): 328–338.10.1002/(ISSN)1520-6750
  • Park, J., S. Y. Chang, and K. Lee. 2006. “Online and Semi-online Scheduling of Two Machines under a Grade of Service Provision.” Operations Research Letters 34 (6): 692–696.10.1016/j.orl.2005.11.004
  • Woeginger, G. J. 2009. “A Comment on Parallel-Machine Scheduling under a Grade of Service Provision to Minimize Makespan.” Information Processing Letters 109 (7): 341–342.10.1016/j.ipl.2008.11.008
  • Wu, Y., M. Ji, and Q. Yang. 2012. “Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision.” International Journal of Production Economics 135 (1): 367–371.10.1016/j.ijpe.2011.07.021
  • Yan, H. S., X. Q. Wan, and F. L. Xiong. 2014. “A Hybrid Electromagnetism-like Algorithm for Two-stage Assembly Flow Shop Scheduling Problem.” International Journal of Production Research 52 (19): 5626–5639.10.1080/00207543.2014.894257
  • Zhang, R., and C. Wu. 2010. “A Divide-and-conquer Strategy with Particle Swarm Optimization for the Job Shop Scheduling Problem.” Engineering Optimization 42 (7): 641–670.10.1080/03052150903369845

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:

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:

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.