Open Access
Issue
Manufacturing Rev.
Volume 3, 2016
Article Number 18
Number of page(s) 10
DOI http://dx.doi.org/10.1051/mfreview/2016018
Published online 28 October 2016
  1. J.B. Ghosh, Job selection in a heavily loaded shop, Computers & Operations Research 24 (1997) 141–145. [CrossRef]
  2. H. Lewis, S. Slotnick, Multi-period job selection: planning workloads to maximize profit, Computers & Operations Research 29 (2002) 1081–1098. [CrossRef]
  3. A. Moghaddam, F. Yalaoui, L. Amodeo, Efficient meta-heuristics based on various dominance criteria for a single-machine bi-criteria scheduling problem with rejection, Journal of Manufacturing Systems 34 (2015) 12–22. [CrossRef]
  4. H. Mokhtari, A nature inspired intelligent water drops evolutionary algorithm for parallel processor scheduling with rejection, Applied Soft Computing 26 (2015) 166–179. [CrossRef]
  5. X. Wang, Q. Zhu, T. Cheng, Subcontracting price schemes for order acceptance and scheduling, Omega 54 (2015) 1–10, DOI: 10.1016/j.omega.2015.01.005. [CrossRef]
  6. L. Lu, C. Ng, L. Zhang, Optimal algorithms for single-machine scheduling with rejection to minimize the makespan, International Journal of Production Economics 130 (2011) 153–158. [CrossRef]
  7. X. Zhong, J. Ou, G. Wang, Order acceptance and scheduling with machine availability constraints, European Journal of Operational Research 232 (2014) 435–441. [MathSciNet]
  8. J. Ou, X. Zhong, G. Wang, An improved heuristic for parallel machine scheduling with rejection, European Journal of Operational Research 241 (2015) 653–661. [MathSciNet]
  9. M. Khalili, R. Moghaddam, A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem, Journal of Manufacturing Systems 31 (2012) 232–239. [CrossRef]
  10. M. Khalili, A multi-objective electromagnetism algorithm for a bi-objective hybrid no-wait flowshop scheduling problem, The International Journal of Advanced Manufacturing Technology 70 (2014) 1591–1601. [CrossRef]
  11. M. Mahdavi Mazdeh, A.N. Esfahani, S. Sakkaki, A.E. Pilerood, Single machine batch scheduling minimizing weighted flow times and delivery costs with job release times, International Journal of Industrial Engineering Computations 3 (2012) 347–364. [CrossRef]
  12. G. Wang, T. Cheng, Parallel machine scheduling with batch delivery costs, International Journal of Production Economics 68 (2000) 177–183. [CrossRef]
  13. M. Mahdavi Mazdeh, M. Sarhadi, K. Hindi, A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs, European Journal of Operational Research 183 (2007) 74–86. [CrossRef]
  14. M. Ji, Y. He, T. Cheng, Batch delivery scheduling with batch delivery cost on a single machine, European Journal of Operational Research 176 (2007) 745–755. [MathSciNet]
  15. M. Mahdavi Mazdeh, M. Sarhadi, K. Hindi, A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times, Comput. Oper. Res. 35 (2008) 1099–1111. [MathSciNet]
  16. M. Mahdavi Mazdeh, S. Shashaani, A. Ashouri, K. Hindi, Single-machine batch scheduling minimizing weighted flow times and delivery costs, Applied Mathematical Modelling 35 (2011) 563–570. [MathSciNet]
  17. A. Hamidinia, S. Khakabimamaghani, M. Mahdavi Mazdeh, M. Jafari, A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system, Computers & Industrial Engineering 62 (2012) 29–38. [CrossRef]
  18. E. Selvarajah, R. Zhang, Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs, International Journal of Production Economics 147A (2014) 117–124. [CrossRef]
  19. E. Atashpaz-Gargari, C. Lucas, Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition, IEEE Congress on Evolutionary Computation (CEC 2007) (2007) 4661–4667. [CrossRef]