Skip to main content
SpringerLink
Log in

Heuristic Algorithms of Single-Machine Multi-criteria Scheduling

  • Conference paper
Information Computing and Applications (ICICA 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 308))

Included in the following conference series:

  • 1801 Accesses

Abstract

In the paper, we consider a special situation of minimizing the total earliness and tardiness for the single-machine multi-criteria scheduling problem, in where the cost of earliness and tardiness penalty penalties are equal to each other and take 1. We propose some properties for the optimal schedule and present the heuristic algorithms for solving this problem, and then, we analyze its quality by an example.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brucker, P.: Scheduling Algorithms, 3rd edn. Springer, Berlin (2001)

    MATH  Google Scholar 

  2. Tang, G., Luo, S., Liu, L.: Modern Scheduling Theory, The 1st edn. Shanghai Popular Science Press (2003)

    Google Scholar 

  3. Dileepan, P., Sen, T.: Bicriterion Static Scheduling Research for a Single Machine. Omega 16(1), 53–59 (1998)

    Article  Google Scholar 

  4. Li, Z., Vairaktarakis, G.L.: Complexity of single machine hierarchical scheduling: A survey, pp. 269–298. World Scientific Publishing Company, New Jersey (1993)

    Google Scholar 

  5. Kanet, J.J.: Naval Research Logistics Quarterly 28, 643–651 (1981)

    Google Scholar 

  6. Baker, K.R., Smith, J.C.: A multiple-criterion model for machine scheduling. Journal of Scheduling (6), 7–16 (2003)

    Google Scholar 

  7. Molaee, E., Moslehi, G., Reisi, M.: Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem. Computer and Mathematics with Applications 60, 2909–2919 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Solveling, G., Solak, S., Clarke, J.-P.B., Johnson, E.L.: Scheduling of runway operations for reduced environmental impact. Transportation Research Part D 16, 110–120 (2011)

    Article  Google Scholar 

  9. Mondal, S.A., Sen, A.K.: Single machine weighted earliness-tardiness penalty problem with a common due date. Computer & Operations Research 28, 649–669 (2001)

    Article  MATH  Google Scholar 

  10. Zhu, Z., Heady, R.B.: Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Computer & Industrial Engineering 38, 297–305 (2000)

    Article  Google Scholar 

  11. Jie, S.Y., Wu, S.: A Sequencing Problem in Loading and Unloading Goods. Journal of Operational Research 4(4), 1–11 (2000)

    Google Scholar 

  12. Cheng, T.C.E., Kang, L.-Y., Ng, C.T.: Due-date assignment and single machine scheduling with deteriorating jobs. Journal of the Operational Research Society 55, 198–203 (2004)

    Article  MATH  Google Scholar 

  13. Hendel, Y., Sourd, F.: An improved earliness-tardiness timing algorithm. Computer & Operations Research 34, 2931–2938 (2007)

    Article  MATH  Google Scholar 

  14. Cheng, T.C.E., Kang, L.-Y., Ng, C.T.: Single machine due-date scheduling of jobs with decreasing start-time dependent processing times. International Transactions in Operational Research 12, 335–366 (2005)

    Article  MathSciNet  Google Scholar 

  15. Hall, N.G., Posner, M.E.: Earliness-tardiness scheduling problem I: Weighted deviation of completion times about a common due date. Operations Research 39(5), 836–846 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  16. Cheng, T.C.E., Ng, C.T., Yuan, J.-J., et al.: Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research 165, 423–443 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Erenay, F.S., Sabuncuoglu, I., Toptal, A.: New solution methods for single machine bicriteria scheduling problem: Minimization of average flow time and number of tardy jobs. European Journal of Operational Research 201, 89–98 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  18. Hall, N.G., Kubiak, W., Sethi, S.P.: Earliness-tardiness scheduling problem II: Deviation of completion times about a restrictive common due date. Operations Research 39(5), 847–856 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  19. Fan, B., Li, S., Zhou, L., Zhang, L.: Scheduling resumable deteriorating jobs on a single machine with non-availability constraints. Theoretical Computer Science 412, 275–280 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hoogeveen, H.: Multicriteria scheduling. European Journal of Operational Research 167, 592–623 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Hoogeveen, J.A.: Single-machine scheduling to minimize a function of two or three maximum cost criteria. Journal of Algorithms 21, 415–433 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  22. Chang, P.C.: A Branch and Bound Approach for Single Machine Scheduling with Earliness and Tardiness Penalties. Computers and Mathematics with Applications 37, 133–144 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  23. Song, Z.F., Sun, S.J., Wu, C.Y.: A Scheduling Problem with Earliness Award and Tardiness Penalty. Journal of Operation Research 6(4), 31–36 (2002)

    Google Scholar 

  24. Peng, S., Xu, G.: The structure and method of optimal solution for the single machine scheduling problem. Applied Mathematics 11(1), 25–28 (1998)

    MathSciNet  Google Scholar 

  25. Zhang, R.: The optimal solution of the single machine scheduling problem. Journal of Liaocheng Normal College 14(2), 38–40 (2001)

    Google Scholar 

  26. Zhang, R., Liu, G.: The optimal solution of CET problem in the single machine scheduling problem. Journal of Zibo College (Science Edition) 3(3), 20–22 (2001)

    Google Scholar 

  27. Lin, S.-W., Chou, S.-Y., Ying, K.-C.: A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date. European Journal of Operational Research 117, 1294–1301 (2007)

    Article  Google Scholar 

  28. Hallah, R.M.: Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Computer & Operations Research 34, 3126–3142 (2007)

    Article  MATH  Google Scholar 

  29. Mosheior, G., Shamon, M.: Minmax earliness-tardiness costs with unit processing time job. European Journal of Operational Research 130, 638–652 (2001)

    Article  MathSciNet  Google Scholar 

  30. Tian, Z.-J., Ng, C.T., Cheng, T.C.E.: On the single machine total tardiness problem. European Journal of Operational Research 165, 843–846 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  31. Panahi, H., Tavakkoli-Moghaddam, R.: Solving a multi-objective open shop scheduling problem by a novel hybrid ant colony optimization. Expert Systems with Applications 38, 2817–2822 (2001)

    Article  Google Scholar 

  32. Lee, W.-C., Lai, P.-J.: Scheduling problems with general effects of deterioration and learning. Information Science 181, 1164–1170 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Science, Hebei United University, Tangshan, China

    Shuming Guan, Junhong Ma, Xiaoqing Lu & Wenyi Zhang

Authors
  1. Shuming Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Junhong Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaoqing Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenyi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Sciences, Hebei United University, 063000, Tangshan, Hebei, China

    Chunfeng Liu  & Aimin Yang  & 

  2. Northeastern University at Qinhuangdao, Hebei, China

    Leizhen Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guan, S., Ma, J., Lu, X., Zhang, W. (2012). Heuristic Algorithms of Single-Machine Multi-criteria Scheduling. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34041-3_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34041-3_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34040-6

  • Online ISBN: 978-3-642-34041-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation