Scheduling on a proportionate flowshop to minimise total late work

References

• Blazewicz, J. 1984. “Scheduling Preemptible Tasks on Parallel Processors with Information Loss.” Technique Et Science Informatiques 3 (6): 415–420.
   Google Scholar
• Blazewicz, J. , E. Pesch , M. Sterna , and F. Werner . 2004. “Flow Shop Scheduling with Late Work Criterion–Choosing the Best Solution Strategy.” Lecture Notes in Computer Science 3285: 68–75.10.1007/b101591
   Google Scholar
• Blazewicz, J. , E. Pesch , M. Sterna , and F. Werner . 2005a. “The Two-machine Flow-shop Problem with Weighted Late Work Criterion and Common Due Date.” European Journal of Operational Research 165 (2): 408–415.10.1016/j.ejor.2004.04.011
   Web of Science ®Google Scholar
• Blazewicz, J. , E. Pesch , M. Sterna , and F. Werner . 2005b. “A Comparison of Solution Procedures for Two-machine Flow Shop Scheduling with Late Work Criterion.” Computers & Industrial Engineering 49 (4): 611–624.10.1016/j.cie.2005.09.001
   Web of Science ®Google Scholar
• Gerstl, E. , B. Mor , and G. Mosheiov . 2015. “A Note: Maximizing the Weighted Number of Just-in-Time Jobs on a Proportionate Flowshop.” Information Processing Letters 115 (2): 159–162.10.1016/j.ipl.2014.09.004
   Web of Science ®Google Scholar
• Guinet, A. G. P. , and M. M. Solomon . 1996. “Scheduling Hybrid Flowshops to Minimize Maximum Tardiness or Maximum Completion Time.” International Journal of Production Research 34 (6): 1643–1654.10.1080/00207549608904988
   Web of Science ®Google Scholar
• Huang, R. H. , and C. L. Yang. 2007. “Single-machine Scheduling to Minimize the Number of Early Jobs.” In 2007 IEEE International Conference on Industrial Engineering and Engineering Management, Singapore, December.
   Google Scholar
• Lann, A. , and G. Mosheiov . 1996. “Single Machine Scheduling to Minimize the Number of Early and Tardy Jobs.” Computers & Operations Research 23 (8): 769–781.10.1016/0305-0548(95)00078-X
   Web of Science ®Google Scholar
• Lawler, E. L. 1973. “Optimal Sequencing of a Single Machine Subject to Precedence Constraints.” Management Science 19 (5): 544–546.10.1287/mnsc.19.5.544
   Web of Science ®Google Scholar
• Leung J Y.-T. 2004. “Minimizing Total Weighted Error for Imprecise Computation Tasks and Related Problems.” In Handbook of Scheduling: Algorithms, Models, and Performance Analysis, edited by J. Y.-T. Leung , vol. 34, 1–16. Boca Raton, FL: CRC Press.
   Google Scholar
• Lin, B. M. T. , F. C. Lin , and R. C. T. Lee . 2006. “Two-machine Flow-shop Scheduling to Minimize Total Late Work.” Engineering Optimization 38 (4): 501–509.10.1080/03052150500420439
   Web of Science ®Google Scholar
• Moore, J. M. 1968. “An N Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs.” Management Science 15 (1): 102–109.10.1287/mnsc.15.1.102
   Web of Science ®Google Scholar
• Mor, B. , and G. Mosheiov . 2014. “Minimizing the Number of Early Jobs on a Proportionate Flowshop.” Journal of the Operational Research Society 66 (9): 1426–1429.
   Web of Science ®Google Scholar
• Mor, B. , and G. Mosheiov . 2015. “A Note: Minimizing Maximum Earliness on a Proportionate Flowshop.” Information Processing Letters 115 (2): 253–255.10.1016/j.ipl.2014.09.023
   Web of Science ®Google Scholar
• Pesch, E. , and M. Sterna . 2009. “Late Work Minimization in Flow Shops by a Genetic Algorithm.” Computers & Industrial Engineering 57 (4): 1202–1209.10.1016/j.cie.2009.05.011
   Web of Science ®Google Scholar
• Pinedo, M. L. 2015. Scheduling: Theory, Algorithms and Systems. 4th ed. New York: Springer.
   Google Scholar
• Potts, C. N. , and L. N. Van Wassenhove . 1992. “Single Machine Scheduling to Minimize Total Late Work.” Operations Research 40 (3): 586–595.10.1287/opre.40.3.586
   Web of Science ®Google Scholar
• Ren, J. , Y. Zhang , and G. Sun . 2009. “The NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine.” Asia-Pacific Journal of Operational Research 26 (03): 351–363.10.1142/S0217595909002249
   Google Scholar
• Shabtay, D. 2012. “The Just-in-Time Scheduling Problem in a Flow-shop Scheduling System.” European Journal of Operational Research 216 (3): 521–532.10.1016/j.ejor.2011.07.053
   Web of Science ®Google Scholar
• Shakhlevich, N. , H. Hoogeveen , and M. Pinedo . 1998. “Minimizing Total Weighted Completion Time in a Proportionate Flow Shop.” Journal of Scheduling 1 (3): 157–168.10.1002/(ISSN)1099-1425
   Google Scholar
• Sterna, M. 2007. “Dominance Relations for Two-machine Flow-shop Problem with Late Work Criterion.” Bulletin of the Polish Academy of Sciences 55 (1): 59–69.
   Web of Science ®Google Scholar
• Sterna, M. 2011. “A Survey of Scheduling Problems with Late Work Criteria.” Omega 39 (2): 120–129.10.1016/j.omega.2010.06.006
   Web of Science ®Google Scholar