Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria

References

• Della Croce F., Gupta J., Tadei R. Minimizing tardy jobs in a flowshop with common due date. Eur. J. Oper. Res. (2000) 120:375–381Crossref, Google Scholar
• Gordon V., Proth J.-M., Chu C. A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. (2002) 139:1–25Crossref, Google Scholar
• Gordon V., Proth J.-M., Strusevich V., Leung J.-T. Scheduling with due-date assignment. Handbook of Scheduling: Algorithms, Models and Performance Analysis (2004) 1(Chapman and Hall/CRC Computer and Information Science series, Chapman and Hall/CRC, Boca Raton, FL) . Chap. 21Google Scholar
• Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. (1979) 5:287–326Crossref, Google Scholar
• Gupta J., Hariri A. Integrating job selection and scheduling in a flowshop. (1994) . Research report, Department of Management, Ball State University, Muncie, INGoogle Scholar
• Gupta J., Hariri A. Two machine flow-shop to minimize number of tardy jobs. J. Oper. Res. Soc. (1997) 48:212–220Crossref, Google Scholar
• Hariri A., Potts C. A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop. Eur. J. Oper. Res. (1989) 38:228–237Crossref, Google Scholar
• Ho J., Gupta J. Flowshop scheduling with dominant machines. Comput. Oper. Res. (1995) 22:237–246Crossref, Google Scholar
• Hoogeveen H. Multicriteria scheduling. Eur. J. Oper. Res. (2005) 167:592–623Crossref, Google Scholar
• Johnson S. Optimal two and three stage production schedules with set-up time included. Naval Res. Logist. Quart. (1954) 1:61–68Crossref, Google Scholar
• Jozefowska J., Jurish B., Kubiak W. Scheduling shops to minimize the weighted number of late jobs. Oper. Res. Lett. (1994) 10:27–33Google Scholar
• Lawler E., Moore J. A functional equation and its application to resource allocation and sequencing problems. Management Sci. (1969) 16:77–84Link, Google Scholar
• Liao C.-L., Yu W.-C., Joe C.-B. Bicriterion scheduling in the two-machine flowshop. J. Oper. Res. Soc. (1997) 48:929–935Crossref, Google Scholar
• Linderoth J., Savelsbergh M. A computational study of search strategies for mixed integer programming. INFORMS J. Comput. (1999) 11:173–187Link, Google Scholar
• Osorio M. A., Glover F., Hammer P. Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions. Ann. Oper. Res. (2002) 117:71–93Crossref, Google Scholar
• Potts C., van Wassenhove L. Algorithms for scheduling a single machine to minimize the weighted number of late jobs. Management Sci. (1988) 34:843–858Link, Google Scholar
• T’kindt V., Billaut J.-C.Multicriteria Scheduling: Theory, Models and Algorithms (2002) (Springer-Verlag, Heidelberg, Germany) Crossref, Google Scholar