Assessing scheduling policies in a permutation flowshop with common due dates

References

• Agnetis, A., J. C. Billaut, S. Gawiejnowicz, D. Pacciarelli, and A. Soukhal. 2014. Multiagent Scheduling: Models and Algorithms. Berlin: Springer-Verlag.
   Google Scholar
• Akkan, C. 1997. “Finite-capacity Scheduling-based Planning for Revenue-based Capacity Management.” European Journal of Operational Research 100 (1): 170–179.
   Web of Science ®Google Scholar
• Armentano, V. A., and D. P. Ronconi. 1999. “Tabu Search for Total Tardiness Minimization in Flowshop Scheduling Problems.” Computers & Operations Research 26 (3): 219–235.
   Web of Science ®Google Scholar
• Birman, M., and G. Mosheiov. 2004. “A Note on a Due-date Assignment on a Two-machine Flow-shop.” Computers & Operations Research 31 (3): 473–480.
   Web of Science ®Google Scholar
• Blazewicz, J., E. Pesch, M. Sterna, and F. Werner. 2004. “Flow Shop Scheduling with Late Work Criterion -- Choosing the Best Solution Strategy.” In Proceedings, Applied Computing. Second Asian Applied Computing Conference, AACC 2004, Kathmandu, Nepal, October 29-31, 2004. Vol. 3285/2004, Lecture Notes in Computer Science, 68–75. Berlin/Heidelberg: Springer.
   Google Scholar
• Blazewicz, J., E. Pesch, M. Sterna, and F. Werner. 2008. “Metaheuristic Approaches for the Two-machine Flow-shop Problem with Weighted Late Work Criterion and Common Due Date.” Computers & Operations Research 35 (2): 574–599.
   Web of Science ®Google Scholar
• Della Croce, F., J. N. D. Gupta, and R. Tadei. 2000. “Minimizing Tardy Jobs in a Flowshop with Common Due Date.” European Journal of Operational Research 120 (2): 375–381.
   Web of Science ®Google Scholar
• Fernandez-Viagas, V., and J. M. Framinan. 2014. “On Insertion Tie-breaking Rules in Heuristics for the Permutation Flowshop Scheduling Problem.” Computers & Operations Research 45: 60–67.
   Web of Science ®Google Scholar
• Framinan, J. M., and R. Leisten. 2008. “Total Tardiness Minimisation in Permutations Flow Shops: A Simple Approach Based on a Variable Greedy Algorithm.” International Journal of Production Research 46 (22): 6479–6498.
   Web of Science ®Google Scholar
• Framinan, J. M., and R. Leisten. 2010. “Available-to-promise (ATP) Systems: A Classification and Framework for Analysis.” International Journal of Production Research 48 (11): 3079–3103.
   Web of Science ®Google Scholar
• Frederix, F. 2001. “An Extended Enterprise Planning Methodology for the Discrete Manufacturing Industry.” European Journal of Operational Research 129 (2): 317–325.
   Web of Science ®Google Scholar
• Garey, M. R., D. S. Johnson, and R. Sethi. 1976. “The Complexity of Flowshop and Jobshop Scheduling.” Mathematics of Operations Research 1 (2): 117–129.
   Google Scholar
• Gelders, L. F., and N. Sambandam. 1978. “Four Simple Heuristics for Scheduling a Flowshop.” International Journal of Production Research 16 (3): 221–231.
   Web of Science ®Google Scholar
• Graham, R., E. L. Lawler, J. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Gupta, J. N. D., and E. F. Stafford. 2006. “Flowshop Scheduling Research After Five Decades.” European Journal of Operational Research 169 (3): 699–711.
   Web of Science ®Google Scholar
• Hasija, S., and C. Rajendran. 2004. “Scheduling in Flowshops to Minimize Total Tardiness of Jobs.” International Journal of Production Research 42 (11): 2289–2301.
   Web of Science ®Google Scholar
• Huynh-Tuong, N., and A. Soukhal. 2009. “Interfering Job Set Scheduling on Two-operation Three-machine Flowshop.” In IEEE-RIVF International Conference on Computing and Communication Technologies: Research, Innovation and Vision for the Future, RIVF 2009, Da Nang, 1–5.
   Google Scholar
• Johnson, S. M. 1954. “Optimal Two-stages and Three-stage Production Schedules with Setup Times Included.” Naval Research Logistics Quarterly 1: 61–67.
   Google Scholar
• Khelifati, S. L., and F. Bouzid-Sitayeb. 2011a. “A Multi-agent Scheduling Approach for the Joint Scheduling of Jobs and Maintenance Operations in the Flow Shop Sequencing Problem.” Lecture Notes in Computer Science 6923 LNAI (PART 2): 60–69.
   Google Scholar
• Khelifati, S. L., and F. Bouzid-Sitayeb. 2011b. “A Sequantial Distributed Approach for the Joint Scheduling of Jobs and Maintenance Operations in the Flowshop Sequencing Problem.” In International Conference on Intelligent Systems Design and Applications, ISDA, Cordoba, 420–425.
   Google Scholar
• Lee, C. Y. 1997. “Minimizing the Makespan in the Two-machine Flowshop Scheduling Problem with an Availability Constraint.” Operations Research Letters 20 (3): 129–139.
   Web of Science ®Google Scholar
• Lee, W. C., S. K. Chen, C. W. Chen, and C. C. Wu. 2011. “A Two-machine Flowshop Problem with Two Agents.” Computers and Operations Research 38 (1): 98–104.
   Web of Science ®Google Scholar
• Luo, W., L. Chen, and G. Zhang. 2012. “Approximation Schemes for Two-machine Flowshop Scheduling with Two Agents.” Journal of Combinatorial Optimization 24 (3): 229–239.
   Web of Science ®Google Scholar
• Montgomery, D. C. 2005. Design and Analysis of Experiments. 6th ed. New York: John Wiley and Sons.
   Google Scholar
• Mor, B., and G. Mosheiov. 2014. “Polynomial Time Solutions for Scheduling Problems on a Proportionate Flowshop with Two Competing Agents.” Journal of the Operational Research Society 65 (1): 151–157.
   Web of Science ®Google Scholar
• Nagano, M. S., R. Ruiz, and L. A. Nogueira Lorena. 2008. “A Constructive Genetic Algorithm for Permutation Flowshop Scheduling.” Computers & Industrial Engineering 55 (1): 195–207.
   Web of Science ®Google Scholar
• Perez-Gonzalez, P., and J. M. Framinan. 2009. “Scheduling Permutation Flowshops with Initial Availability Constraint: Analysis of Solutions and Constructive Heuristics.” Computers & Operations Research 36 (10): 2866–2876.
   Web of Science ®Google Scholar
• Perez-Gonzalez, P., and J. M. Framinan. 2014. “A Common Framework and Taxonomy for Multicriteria Scheduling Problems with Interfering and Competing Jobs: Multi-agent Scheduling Problems.” European Journal of Operational Research 235 (1): 1–16.
   Web of Science ®Google Scholar
• Ribas, I., R. Companys, and X. Tort-Martorell. 2010. “Comparing Three-step Heuristics for the Permutation Flow Shop Problem.” Computers and Operations Research 37 (12): 2062–2070.
   Web of Science ®Google Scholar
• Sakuraba, S., D. P. Ronconi, and F. Sourd. 2009. “Scheduling in a Two-machine Flowshop for the Minimization of the Mean Absolute Deviation from a Common Due Date.” Computers & Operations Research 36 (1): 60–72.
   Web of Science ®Google Scholar
• Sarper, H. 1995. “Minimizing the Sum of Absolute Deviations About a Common Due Date for the Two-machine Flow Shop Problem.” Applied Mathematical Modelling 19 (3): 153–161.
   Web of Science ®Google Scholar
• Taillard, E. D. 1990. “Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem.” European Journal of Operational Research 47 (1): 65–74.
   Web of Science ®Google Scholar
• Taillard, E. D. 1993. “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64 (2): 278–285.
   Web of Science ®Google Scholar
• Taillard, E. D.. 2014. “Scheduling Instances: Summary of Best Known Lower and Upper Bounds of Taillard’s Instances.” http://mistic.heig-vd.ch/taillard.
   Google Scholar
• T’kindt, V., and J. C. Billaut. 2002. Multicriteria Scheduling: Theory, Models and Algorithms. 2nd ed. Berlin: Springer.
   Google Scholar
• Tzeng, Y. R., and C. L. Chen. 2012. “A Hybrid EDA with ACS for Solving Permutation Flow Shop Scheduling.” The International Journal of Advanced Manufacturing Technology 60 (9--12): 1139–1147.
   Web of Science ®Google Scholar
• Unal, A. T., R. Uzsoy, and A. S. Kiran. 1997. “Rescheduling on a Single Machine with Part-type Dependent Setup Times and Deadlines.” Annals of Operations Research 70: 93–113.
   Web of Science ®Google Scholar
• Vallada, E., R. Ruiz, and J. M. Framinan. 2015. “New Hard Benchmark for Flowshop Scheduling Problems Minimising Makespan.” European Journal of Operational Research 240 (3): 666–677.
   Web of Science ®Google Scholar
• Vig, M. M., and K. J. Dooley. 1991. “Dynamic Rules for Due-date Assignment.” International Journal of Production Research 29 (7): 1361–1377.
   Web of Science ®Google Scholar
• Xu, X. Q., and D. M. Lei. 2014. “A Parallel Iterated Local Search for Two-agent Flow Shop Scheduling.” Advanced Materials Research 926--930: 3476–3484.
   Google Scholar