A fast heuristic to minimize number of tardy jobs in preemptive open shops

References

• Andresen, M., H. Bräsel, M. Mörig, J. Tusch, F. Werner and P. Willenius, “Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop,” Mathematical and Computer Modelling, 48, 1279–1293 (2008).
   Google Scholar
• Bai, D. and L. Tang, “Open shop scheduling problem to minimize makespan with release dates,” Applied Mathematical Modelling, 37, 2008–2015 (2013).
   Web of Science ®Google Scholar
• Bräsel, H. and H. Hennes, “On the open-shop problem with preemption and minimizing the average completion time,” European Journal of Operational Research, 157, 607–619 (2004).
   Google Scholar
• Bräsel, H., A. Herms, M. Mörig, T. Tautenhahn and J. Tusch, “Heuristic constructive algorithms for open shop scheduling to minimize mean flow time,” European Journal of Operational Research, 189(3), 856–870 (2008).
   Google Scholar
• Brucker, P., Scheduling Algorithms. 5th ed. Berlin Heidelberg: Springer (2007).
   Google Scholar
• Brucker, P., J. Hurink, B. Jurisch and B. Wöstmann, “A branch & bound algorithm for the open-shop problem,” Discrete Applied Mathematics, 76, 43–59 (1997).
   Web of Science ®Google Scholar
• Chen, Y., A. Zhang, G. Chen and J. Dong, “Approximation algorithms for parallel open shop scheduling,” Information Processing Letters, 113, 220–224 (2013).
   Google Scholar
• Cho, Y. and S. Sahni, “Preemptive scheduling of independent jobs with release and due times on open, flow and job shops,” Operations Research, 29, 511–522 (1981).
   Web of Science ®Google Scholar
• Dorndorf, U., E. Pesch and T. Phan-Huy, “Solving the open shop scheduling problem,” Journal of Scheduling, 4, 157–174 (2001).
   Web of Science ®Google Scholar
• Fisher, M. L., “A dual algorithm for the one-machine scheduling problem,” Mathematical Programming, 11, 229–251 (1976).
   Web of Science ®Google Scholar
• Goldansaz, S. M., Jolai, F. and Anaraki, A. H. Z., “A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop,” Applied Mathematical Modelling (2013), Available online at: http://dx.doi.org/10.1016/j.apm.2013.05.002.
   Google Scholar
• Goldberg, A. V. and Tarjan, R. E., “A new approach to the maximum flow problem,” in: Proceedings of the 18th ACM Symposium on the theory of computation, 136–146 (1986).
   Google Scholar
• Gonzalez, T. and S. Sahni, “Open shop scheduling to minimize finish time,” Journal of the Association for Computing Machinery, 23(4), 665–679 (1976).
   Web of Science ®Google Scholar
• Gonzalez, T., “A note on open shop preemptive schedules,” IEEE Transactions on Computers, C-28, 782–786 (1979).
   Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy, “Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey”,” Annals of Discrete Mathematics, 5, 287–326 (1979).
   Google Scholar
• Hashemi Doulabi, S. H., “A mixed integer linear formulation for open shop earliness-tardiness scheduling problem,” Applied Mathematical Science, 4(35), 1703–1710 (2010).
   Google Scholar
• Kuhn, H. W., “The Hungarian method for the assignment problem,” Naval Research Logistics Quarterly, 1, 83–97 (1955).
   Google Scholar
• Kis, T., D. Werra and W. Kubiak, “A projective algorithm for preemptive open shop scheduling with two multiprocessor groups,” Operations Research Letters, 38(2), 129–132 (2010).
   Google Scholar
• Lawler, E. L., J. K. Lenstra and A. H. G. Rinnooy Kan, “Minimizing maximum lateness in a two-machine open shop,” Mathematics of Operations Research, 6(1), 153–158 (1981).
   Web of Science ®Google Scholar
• Lawler, E. L., J. K. Lenstra and A. H. G. Rinnooy Kan, “Erratum: Minimizing maximum lateness in a two-machine open shop”, [Mathematics of Operations Research, 6(1), 153–158 (1981)], Mathematics of Operations Research, 7(4), 635 (1982).
   Google Scholar
• Liaw, C. F., “Scheduling preemptive open shops to minimize total tardiness,” European Journal of Operational Research, 162, 173–183 (2005).
   Web of Science ®Google Scholar
• Liaw, C. F., “Scheduling two-machine preemptive open shops to minimize total completion time,” Computers & Operations Research, 31, 1349–1363 (2004).
   Web of Science ®Google Scholar
• Liu, C. Y. and R. L. Bulfin, “On the complexity of preemptive open shop scheduling problem,” Operations Research Letters, 4, 71–74 (1985).
   Google Scholar
• Liu, C. Y. and R. L. Bulfin, “Scheduling ordered open shops,” Computers & Operations Research, 14(3), 257–264 (1987).
   Google Scholar
• Liu, C. Y., “A branch-and-bound algorithm for the preemptive open shop scheduling problem,” Journal of the Chinese Institute of Industrial Engineers, 12(1), 25–31 (1995).
   Google Scholar
• Low, C. and Y. Yeh, “Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing and removal times separated,” Robotics and Computer-Integrated Manufacturing, 25, 314–322 (2009).
   Web of Science ®Google Scholar
• Malapert, A., H. Cambazard, C. Gueret, N. Jussien, A. Langevin and L. M. Rousseau, “An optimal constraint programming approach to the open-shop problem,” Journal on Computing, 24, 228–244 (2012).
   Google Scholar
• Moore, J. M., “Sequencing n jobs on one machine to minimize the number of tardy jobs,” Management Science, 15, 102–109 (1968).
   Web of Science ®Google Scholar
• Naderi, B., Fatemi Ghomi, S. M. T., Aminayeri, M. and Zandieh, M., “A contribution and new heuristics for open shop scheduling,” Computers & Operations Research, 37, 213–221 (2010).
   Web of Science ®Google Scholar
• Naderi, B., Fatemi Ghomi, S. M. T., Aminnayeri, M. and Zandieh, M., “A study on open shop scheduling to minimize total tardiness”, International Journal of Production Research, 49(15), 4657–4678 (2011).
   Web of Science ®Google Scholar
• Naderi, B., E. Najafi and M. Yazdani, “An electromagnetism-like metaheuristic for open-shop problems with no buffer,” Journal of Industrial Engineering International, 8:29 (2012), Available online at: http://www.jiei-tsb.com/content/8/1/29.
   Google Scholar
• Pinedo, M., Scheduling: Theory, Algorithms, and Systems, Prentice Hall; 4th Edition (2012).
   Google Scholar
• Sedeno-Noda, A., D. Alcaide and C. Gonzalez-Martin, “Network flow approaches to preemptive open-shop scheduling problems with time-windows,” European Journal of Operational Research, 174, 1501–1518 (2006).
   Google Scholar
• Seraj, O. and R. Tavakkoli-Moghaddam, “A tabu search method for a new bi-objective open shop scheduling problem by a fuzzy multi-objective decision making approach,” International Journal of Engineering-Transactions B: Application, 22(3), 269–282 (2009).
   Google Scholar
• Werra, D., T. Kis and W. Kubiak, “Preemptive open shop scheduling with multiprocessors: polynomial cases and applications,” Journal of Scheduling, 11(1), 75–83 (2008).
   Google Scholar
• Zhan, Y., Y. G. Zhong and H. T. Zhu, “Preemptive Open-Shop Scheduling: Network Flow Based Algorithm,” Advanced Materials Research, 215, 111–114 (2011).
   Google Scholar