Skip to main content
Top

2016 | OriginalPaper | Chapter

4. Advanced Single Machine Models (Deterministic)

Author : Michael L. Pinedo

Published in: Scheduling

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This chapter covers several more advanced topics in single machine scheduling. Some of these topics are important because of the theoretical insights they provide, others are important because of their applications in practice.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference A. Allahverdi, C. Ng, T. Cheng and M. Kovalyov (2008) “A Survey of Scheduling Problems with Setup Times”, European Journal of Operational Research, Vol. 187, pp. 985–1032.CrossRefMathSciNetMATH A. Allahverdi, C. Ng, T. Cheng and M. Kovalyov (2008) “A Survey of Scheduling Problems with Setup Times”, European Journal of Operational Research, Vol. 187, pp. 985–1032.CrossRefMathSciNetMATH
go back to reference K.R. Baker and G.D. Scudder (1990) “Sequencing with Earliness and Tardiness Penalties: A Review”, Operations Research, Vol. 38, pp. 22–36.CrossRefMathSciNetMATH K.R. Baker and G.D. Scudder (1990) “Sequencing with Earliness and Tardiness Penalties: A Review”, Operations Research, Vol. 38, pp. 22–36.CrossRefMathSciNetMATH
go back to reference K.R. Baker and D. Trietsch (2009) Principles of Sequencing and Scheduling, J. Wiley, Hoboken, New Jersey.CrossRefMATH K.R. Baker and D. Trietsch (2009) Principles of Sequencing and Scheduling, J. Wiley, Hoboken, New Jersey.CrossRefMATH
go back to reference L. Bianco, S. Ricciardelli, G. Rinaldi and A. Sassano (1988) “Scheduling Tasks with Sequence-Dependent Processing Times”, Naval Research Logistics Quarterly, Vol. 35, pp. 177–184.CrossRefMathSciNetMATH L. Bianco, S. Ricciardelli, G. Rinaldi and A. Sassano (1988) “Scheduling Tasks with Sequence-Dependent Processing Times”, Naval Research Logistics Quarterly, Vol. 35, pp. 177–184.CrossRefMathSciNetMATH
go back to reference D. Biskup (2008) “A State-of-the-Art Review on Scheduling with Learning Effects”, European Journal of Operational Research, Vol. 188, pp. 315–329.CrossRefMathSciNetMATH D. Biskup (2008) “A State-of-the-Art Review on Scheduling with Learning Effects”, European Journal of Operational Research, Vol. 188, pp. 315–329.CrossRefMathSciNetMATH
go back to reference P. Brucker (2007) Scheduling Algorithms (Fifth Edition), Springer, Berlin. P. Brucker (2007) Scheduling Algorithms (Fifth Edition), Springer, Berlin.
go back to reference P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn and S.L. van de Velde (1998) “Scheduling a Batching Machine”, Journal of Scheduling, Vol. 1, pp. 31–54.CrossRefMathSciNetMATH P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn and S.L. van de Velde (1998) “Scheduling a Batching Machine”, Journal of Scheduling, Vol. 1, pp. 31–54.CrossRefMathSciNetMATH
go back to reference C.-L. Chen and R.L. Bulfin (1993) “Complexity of Single Machine, Multi-Criteria Scheduling Problems”, European Journal of Operational Research, Vol. 70, pp. 115–125.CrossRefMATH C.-L. Chen and R.L. Bulfin (1993) “Complexity of Single Machine, Multi-Criteria Scheduling Problems”, European Journal of Operational Research, Vol. 70, pp. 115–125.CrossRefMATH
go back to reference C.-L. Chen and R.L. Bulfin (1994) “Scheduling a Single Machine to Minimize Two Criteria: Maximum Tardiness and Number of Tardy Jobs”, IIE Transactions, Vol. 26, pp. 76–84.CrossRef C.-L. Chen and R.L. Bulfin (1994) “Scheduling a Single Machine to Minimize Two Criteria: Maximum Tardiness and Number of Tardy Jobs”, IIE Transactions, Vol. 26, pp. 76–84.CrossRef
go back to reference S. Dunstall, A. Wirth, and K. Baker (2000) “Lower Bounds and Algorithms for Flowtime Minimization on a Single Machine with Set-Up Times”, Journal of Scheduling, Vol. 3, pp. 51–69.CrossRefMathSciNetMATH S. Dunstall, A. Wirth, and K. Baker (2000) “Lower Bounds and Algorithms for Flowtime Minimization on a Single Machine with Set-Up Times”, Journal of Scheduling, Vol. 3, pp. 51–69.CrossRefMathSciNetMATH
go back to reference H. Emmons (1975) “A Note on a Scheduling Problem with Dual Criteria”, Naval Research Logistics Quarterly, Vol. 22, pp. 615–616.CrossRefMathSciNetMATH H. Emmons (1975) “A Note on a Scheduling Problem with Dual Criteria”, Naval Research Logistics Quarterly, Vol. 22, pp. 615–616.CrossRefMathSciNetMATH
go back to reference P.C. Gilmore and R.E. Gomory (1964) “Sequencing a One-State Variable Machine: a Solvable Case of the Travelling Salesman Problem”, Operations Research, Vol. 12, pp. 655–679.CrossRefMathSciNetMATH P.C. Gilmore and R.E. Gomory (1964) “Sequencing a One-State Variable Machine: a Solvable Case of the Travelling Salesman Problem”, Operations Research, Vol. 12, pp. 655–679.CrossRefMathSciNetMATH
go back to reference N.G. Hall, W. Kubiak and S.P. Sethi (1991) “Earliness-Tardiness Scheduling Problems, II: Weighted Deviation of Completion Times about a Common Due Date”, Operations Research, Vol. 39, pp. 847–856.MathSciNetMATH N.G. Hall, W. Kubiak and S.P. Sethi (1991) “Earliness-Tardiness Scheduling Problems, II: Weighted Deviation of Completion Times about a Common Due Date”, Operations Research, Vol. 39, pp. 847–856.MathSciNetMATH
go back to reference N.G. Hall and M.E. Posner (1991) “Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times about a Common Due Date”, Operations Research, Vol. 39, pp. 836–846.MathSciNetMATH N.G. Hall and M.E. Posner (1991) “Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times about a Common Due Date”, Operations Research, Vol. 39, pp. 836–846.MathSciNetMATH
go back to reference J.A. (Han) Hoogeveen (2005) “Multicriteria Scheduling”, European Journal of Operational Research, Vol. 167, pp. 592–623. J.A. (Han) Hoogeveen (2005) “Multicriteria Scheduling”, European Journal of Operational Research, Vol. 167, pp. 592–623.
go back to reference J.A. Hoogeveen and S.L. Van de Velde (1995) “Minimizing Total Completion Time and Maximum Cost Simultaneously is Solvable in Polynomial Time”, Operations Research Letters, Vol. 17, pp. 205–208.CrossRefMathSciNetMATH J.A. Hoogeveen and S.L. Van de Velde (1995) “Minimizing Total Completion Time and Maximum Cost Simultaneously is Solvable in Polynomial Time”, Operations Research Letters, Vol. 17, pp. 205–208.CrossRefMathSciNetMATH
go back to reference Y.-D. Kim and C.A. Yano (1994) “Minimizing Mean Tardiness and Earliness in Single-Machine Scheduling Problems with Unequal Due Dates”, Naval Research Logistics, Vol. 41, pp. 913–933.CrossRefMATH Y.-D. Kim and C.A. Yano (1994) “Minimizing Mean Tardiness and Earliness in Single-Machine Scheduling Problems with Unequal Due Dates”, Naval Research Logistics, Vol. 41, pp. 913–933.CrossRefMATH
go back to reference A. Mason and E. Anderson (1991) “Minimizing Flow Time on a Single Machine with Job Classes and Setup Times”, Naval Research Logistics, Vol. 38, pp. 333–350.CrossRefMathSciNetMATH A. Mason and E. Anderson (1991) “Minimizing Flow Time on a Single Machine with Job Classes and Setup Times”, Naval Research Logistics, Vol. 38, pp. 333–350.CrossRefMathSciNetMATH
go back to reference C.L. Monma and C.N. Potts (1989) “On the Complexity of Scheduling with Batch Setup Times”, Operations Research, Vol. 37, pp. 798–804.CrossRefMathSciNetMATH C.L. Monma and C.N. Potts (1989) “On the Complexity of Scheduling with Batch Setup Times”, Operations Research, Vol. 37, pp. 798–804.CrossRefMathSciNetMATH
go back to reference R.T. Nelson, R.K. Sarin, and R.L. Daniels (1986) “Scheduling with Multiple Performance Measures: The One Machine Case”, Management Science, Vol. 32, pp. 464–479.CrossRefMATH R.T. Nelson, R.K. Sarin, and R.L. Daniels (1986) “Scheduling with Multiple Performance Measures: The One Machine Case”, Management Science, Vol. 32, pp. 464–479.CrossRefMATH
go back to reference C.N. Potts and M.Y. Kovalyov (2000) “Scheduling with Batching: A Review”, European Journal of Operational Research, Vol. 120, pp. 228–249.CrossRefMathSciNetMATH C.N. Potts and M.Y. Kovalyov (2000) “Scheduling with Batching: A Review”, European Journal of Operational Research, Vol. 120, pp. 228–249.CrossRefMathSciNetMATH
go back to reference C.N. Potts and L.N. van Wassenhove (1983) “An Algorithm for Single Machine Sequencing with Deadlines to Minimize Total Weighted Completion Time”, European Journal of Operational Research, Vol. 12, pp. 379–387.CrossRefMATH C.N. Potts and L.N. van Wassenhove (1983) “An Algorithm for Single Machine Sequencing with Deadlines to Minimize Total Weighted Completion Time”, European Journal of Operational Research, Vol. 12, pp. 379–387.CrossRefMATH
go back to reference J.B. Sidney (1977) “Optimal Single Machine Scheduling with Earliness and Tardiness Penalties”, Operations Research, Vol. 25, pp. 62–69.CrossRefMathSciNetMATH J.B. Sidney (1977) “Optimal Single Machine Scheduling with Earliness and Tardiness Penalties”, Operations Research, Vol. 25, pp. 62–69.CrossRefMathSciNetMATH
go back to reference W. Szwarc and S.K. Mukhopadhyay (1995) “Optimal Timing Schedules in Earliness-Tardiness Single Machine Sequencing”, Naval Research Logistics, Vol. 42, pp. 1109–1114.CrossRefMATH W. Szwarc and S.K. Mukhopadhyay (1995) “Optimal Timing Schedules in Earliness-Tardiness Single Machine Sequencing”, Naval Research Logistics, Vol. 42, pp. 1109–1114.CrossRefMATH
go back to reference C.S. Tang (1990) “Scheduling Batches on Parallel Machines with Major and Minor Setups”, European Journal of Operational Research, Vol. 46, pp. 28–37.CrossRefMathSciNetMATH C.S. Tang (1990) “Scheduling Batches on Parallel Machines with Major and Minor Setups”, European Journal of Operational Research, Vol. 46, pp. 28–37.CrossRefMathSciNetMATH
go back to reference V. T’kindt and J.-C. Billaut (2002) Multicriteria Scheduling - Theory, Models, and Algorithms (First Edition), Springer, Berlin.CrossRef V. T’kindt and J.-C. Billaut (2002) Multicriteria Scheduling - Theory, Models, and Algorithms (First Edition), Springer, Berlin.CrossRef
go back to reference V. T’kindt and J.-C. Billaut (2006) Multicriteria Scheduling - Theory, Models, and Algorithms (Second Edition), Springer, Berlin. V. T’kindt and J.-C. Billaut (2006) Multicriteria Scheduling - Theory, Models, and Algorithms (Second Edition), Springer, Berlin.
go back to reference L.N. Van Wassenhove and F. Gelders (1980) “Solving a Bicriterion Scheduling Problem”, European Journal of Operational Research, Vol. 4, pp. 42–48.CrossRefMathSciNet L.N. Van Wassenhove and F. Gelders (1980) “Solving a Bicriterion Scheduling Problem”, European Journal of Operational Research, Vol. 4, pp. 42–48.CrossRefMathSciNet
go back to reference G. Wan and X. Qi (2010) “Scheduling with Variable Time Slot Costs”, Naval Research Logistics, Vol. 57, pp. 159–171.MathSciNetMATH G. Wan and X. Qi (2010) “Scheduling with Variable Time Slot Costs”, Naval Research Logistics, Vol. 57, pp. 159–171.MathSciNetMATH
go back to reference G. Wan and B.P.-C. Yen (2002) “Tabu Search for Total Weighted Earliness and Tardiness Minimization on a Single Machine with Distinct Due Windows”, European Journal of Operational Research, Vol. 142, pp. 271–281.CrossRefMathSciNetMATH G. Wan and B.P.-C. Yen (2002) “Tabu Search for Total Weighted Earliness and Tardiness Minimization on a Single Machine with Distinct Due Windows”, European Journal of Operational Research, Vol. 142, pp. 271–281.CrossRefMathSciNetMATH
go back to reference G. Wan and B.P.-C. Yen (2009) “Single Machine Scheduling to Minimize Total Weighted Earliness subject to Minimum Number Tardy”, European Journal of Operational Research, Vol. 195, pp. 89–97.CrossRefMathSciNetMATH G. Wan and B.P.-C. Yen (2009) “Single Machine Scheduling to Minimize Total Weighted Earliness subject to Minimum Number Tardy”, European Journal of Operational Research, Vol. 195, pp. 89–97.CrossRefMathSciNetMATH
go back to reference R.J. Wittrock (1990) “Scheduling Parallel Machines with Major and Minor Setup Times”, International Journal of Flexible Manufacturing Systems, Vol. 2, pp. 329–341.CrossRef R.J. Wittrock (1990) “Scheduling Parallel Machines with Major and Minor Setup Times”, International Journal of Flexible Manufacturing Systems, Vol. 2, pp. 329–341.CrossRef
Metadata
Title
Advanced Single Machine Models (Deterministic)
Author
Michael L. Pinedo
Copyright Year
2016
DOI
https://doi.org/10.1007/978-3-319-26580-3_4