A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs

References

• Berrichi, A., and F. Yalaoui. 2013. “Efficient Bi-objective Ant Colony Approach to Minimize Total Tardiness and System Unavailability for a Parallel Machine Scheduling Problem.” International Journal of Advanced Manufacturing Technology 68 (9–12): 2295–2310.
   Web of Science ®Google Scholar
• Blazewicz, J., K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz. 2001. Scheduling Computer and Manufacturing Processes. Berlin: Springer-Verlag.
   Google Scholar
• Carlier, J. 1982. “The One Machine Sequencing Problem.” European Journal of Operational Research 11: 42–47.
   Web of Science ®Google Scholar
• Carlier, J. 1987. “Scheduling Jobs with Release Dates and Tails on Identical Machines to Minimize the Makespan.” European Journal of Operational Research 29: 298–306.
   Web of Science ®Google Scholar
• Centeno, G., and R. L. Armacost. 1997. “Parallel Machine Scheduling with Release Time and Machine Eligibility Restrictions.” Computers and Industrial Engineering 33 (1–2): 273–276.
   Web of Science ®Google Scholar
• Centeno, G., and R. L. Armacost. 2004. “Minimizing Makespan on Parallel Machines with Release Time and Machine Eligibility Restrictions.” International Journal of Production Research 42 (6): 1243–125.
   Web of Science ®Google Scholar
• Ciavotta, M., C. Meloni, and M. Pranzo. 2016. “Speeding Up a Rollout Algorithm for Complex Parallel Machine Scheduling.” International Journal of Production Research 54 (16): 4993–5009.
   Web of Science ®Google Scholar
• Ehrgott, M., and X. Gandibleux. 2002. “Multiobjective Combinatorial and Applications.” In Multiple Criteria Optimization. State of the art. Annotated Bibliography. Survey, edited by M. Ehrgott and X. Gandibleux. Boston, MA: Kluwer.
   Google Scholar
• Garey, M. R., and D. S. Johnson. 1989. Computers and Intractability. A Guide to the Theory of NP-completeness. New York: Freeman Ed.
   Google Scholar
• Gharbi, R. L., and M. Haouari. 2002. “Minimizing Makespan on Parallel Machines Subject to Release Dates and Delivery Times.” Journal of Scheduling 5: 329–355.
   Web of Science ®Google Scholar
• Gharbi, R. L., and M. Haouari. 2007. “An Approximate Decomposition Algorithm for Scheduling on Parallel Machines with Heads and Tails.” Computer & Operations Research 34 (3): 868–883.
   Web of Science ®Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. C. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling Theory: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Haouari, M., and A. Gharbi. 2003. “An Improved Max-flow-based Lower Bound for Minimizing Maximum Latenesson Identical Parallel Machines.” Operations Research Letters 31 (1): 49–52.
   Web of Science ®Google Scholar
• Horn, W. A. 1974. “Some Simple Scheduling Algorithms.” Naval Research Logistics Quarterly 21: 177–185.
   Google Scholar
• Lee, K., J. Y. T. Leung, and M. Pinedo. 2011. “Scheduling Jobs with Equal Processing Times Subject to Machine Eligibility Constraints.” Journal of Scheduling 14 (1): 27–38.
   Web of Science ®Google Scholar
• Lei, D. 2009. “Multi-objective Production Scheduling: A Survey.” International Journal of Advanced Manufacturing Technology 43: 926–938.
   Web of Science ®Google Scholar
• Leung, J. Y. T., and C. L. Li. 2008. “Scheduling with Processing Set Restrictions: A Survey.” International Journal of Production Economics 116: 251–262.
   Web of Science ®Google Scholar
• Leung, J. Y. T., and C. L. Li. 2016. “Scheduling with Processing Set Restrictions: A Literature Update.” International Journal of Production Economics 175: 1–11.
   Web of Science ®Google Scholar
• Leung, J. Y. T., H. Li, and M. Pinedo. 2008. “Scheduling Orders on Either Dedicated or Flexible Machines in Parallel to Minimize Total Weighted Completion Time.” Annals of Operational Research 159: 107–123.
   Web of Science ®Google Scholar
• Li, S.. 2016. “Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times.” Mathematical Problems in Engineering 2016: 1–5. Article ID 3203728. doi:10.1155/2016/3203728.
   Web of Science ®Google Scholar
• Li, C. L., and K. Lee. 2016. “A Note on Scheduling Jobs with Equal Processing Times and Inclusive Processing Set Restrictions.” The Journal of the Operational Research Society 67 (1): 83–8.
   Web of Science ®Google Scholar
• Li, C. L., and Q. Y. Li. 2015. “Scheduling Jobs with Release Dates, Equal Processing Times, and Inclusive Processing Set Restrictions.” Journal of the Operational Research Society 66 (3): 516–523.
   Web of Science ®Google Scholar
• Liao, L.-W., and G.-J. Sheen. 2008. “Parallel Machine Scheduling with Machine Availability and Eligibility Constraints.” European Journal of Operational Research 184 (2): 458–467.
   Web of Science ®Google Scholar
• Lin, C.-H., and C.-J. Liao. 2008. “Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions.” The Open Operational Research Journal 2: 18–2.
   Google Scholar
• Lin, S.-W., and K.-C. Ying. 2015. “A Multi-point Simulated Annealing Heuristic for Solving Multiple Objective Unrelated Parallel Machine Scheduling Problems.” International Journal of Production Research 53 (4): 1065–1076.
   Web of Science ®Google Scholar
• Lin, S. W., Z. J. Lee, K. C. Ying, and C. C. Lu. 2011. “Minimization of Maximum Lateness on Parallel Machines with Sequence-dependent Setup Times and Job Release Dates.” Computers & Operations Research 38 (5): 809–815.
   Web of Science ®Google Scholar
• Lin, S.-W., K.-C. Ying, W.-J. Wu, and Y.-I. Chiang. 2016. “Multi-objective Unrelated Parallel Machine Scheduling: A Tabu-enhanced Iterated Pareto Greedy Algorithm.” International Journal of Production Research 54 (4): 1110–1121.
   Web of Science ®Google Scholar
• Loukil, T., J. Teghem, and D. Tuyttens. 2005. “Solving Multi-objective Production Scheduling Using Metaheuristics.” European Journal of Operational Research 161: 42–61.
   Web of Science ®Google Scholar
• Mateo, M., J. Teghem, and D. Tuyttens. 2016. “An Algorithm for a Bi-objective Parallel Machine Problem with Eligibility, Release Dates and Delivery Times of the Jobs.” IFAC-PapersOnLine 49 (12): 1614–1619.
   Google Scholar
• Moghaddam, A., F. Yalaoui, and L. Amodeo. 2015. “Efficient Meta-heuristics Based on Various Dominance Criteria for a Single Machine Bi-criteria Scheduling Problem with Rejection.” Journal of Manufacturing Systems 34: 12–22.
   Web of Science ®Google Scholar
• Mohri, S., T. Masuda, and H. Ishii. 1999. “Bi-criteria Scheduling Problem on Three Identical Parallel Machines.” International Journal of Production Economics 60 (1): 529–536.
   Web of Science ®Google Scholar
• Moradi, E., and M. Zandieh. 2010. “Minimizing the Makespan and the System Unavailability in Parallel Machine Scheduling Problem: A Similarity-based Genetic Algorithm.” International Journal of Advanced Manufacturing Technology 51 (5--8): 829–840.
   Web of Science ®Google Scholar
• Naderi-Beni, M., E. Ghobadian, S. Ebrahimnejad, and R. Tavakkoli-Moghaddam. 2014. “Fuzzy Bi-objective Formulation for a Parallel Machine Scheduling Problem with Machine Eligibility Restrictions and Sequence-dependent Setup Times.” International Journal of Production Research 52 (19): 5799–5822.
   Web of Science ®Google Scholar
• Pinedo, M. L. 2002. Scheduling Theory, Algorithms, and Systems. Upper Saddle River, NJ: Prentice-Hall.
   Google Scholar
• Recalde, D., C. Rutten, P. Schuurman, and T. Vredeveld. 2010. “Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling.” In LATIN 2010. Vol. 6034, LNCS, edited by A. López-Ortiz, 108–119. Heidelberg: Springer.
   Google Scholar
• Shabtay, D., S. Karhi, and D. Oron. 2015. “Multipurpose Machine Scheduling with Rejection and Identical Job Processing Times.” Journal of Scheduling 18 (1): 75–88.
   Web of Science ®Google Scholar
• T’Kindt, V., and J.-Ch. Billaut. 2002. Multicriteria Scheduling (Theory, Models and Algorithms). Berlin: Springer-Verlag.
   Google Scholar
• Tseng, C.-T., C.-H. Lee, Y.-S. P. Chiu, and W.-T. Lu. 2017. “A Discrete Electromagnetism-like Mechanism for Parallel Machine Scheduling Under a Grade of Service Provision.” International Journal of Production Research 55 (11): 3149–3163.
   Web of Science ®Google Scholar
• Wang, I. L., T. Yang, and Y. B. Chang. 2012. “Scheduling Two-stage Hybrid Flow Shops with Parallel Batch, Release Time, and Machine Eligibility Constraints.” Journal of Intelligent Manufacturing 23 (6): 2271–2280.
   Web of Science ®Google Scholar
• Ying, K. C., and H. M. Cheng. 2010. “Dynamic Parallel Machine Scheduling with Sequence-dependent Setup Times Using an Iterated Greedy Heuristic.” Expert systems with Applications 37 (4): 2848–2852.
   Web of Science ®Google Scholar
• Zarandi, M. H. F., and V. Kayvanfar. 2015. “A Bi-objective Identical Parallel Machine Scheduling Problem with Controllable Processing Times: A Just-in-time Approach.” International Journal of Advanced Manufacturing Technology 77 (1--4): 545–563.
   Web of Science ®Google Scholar