Skip to main content
SpringerLink
Log in

Study of the Single-Machine Multi-criteria Scheduling Problem with Common Due Date

  • Conference paper
Information Computing and Applications (ICICA 2011)

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

Included in the following conference series:

Abstract

To study the total earliness and tardiness for the single-machine multi-criteria scheduling problem with common due date, this paper give some conclusions. This processing problem has been proved to be NP-complete, so it is not polynomial solvable and it is reasonable to consider the heuristic algorithms or approximation algorithms. Firstly, this paper provides the specific of this problem. Secondly, it analyzes the structure of the optimal solution and obtains some properties for the optimal schedule. Thirdly, it presents two heuristic algorithms for solving this problem. Lastly, it analyzes 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)

    Book  MATH  Google Scholar 

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

    Article  Google Scholar 

  3. Zhongyi, L.I., Vairaktarakis, G.L.: Complexity of single machine hierarchical scheduling: A survey. World Scientific Publishing Company, New Jersey (1993)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Hall, N.G., Posner, M.E.: Posner: Earliness-Tardiness Scheduling Problems. Operations Research 39, 836–846 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen, C.L., Bulfin, R.L.: Complexity of Single machine, multi-criteria scheduling problems. European Journal of Operational Research 70, 115–125 (1993)

    Article  MATH  Google Scholar 

  7. 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 

  8. 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 (2009)

    Article  MATH  Google Scholar 

  9. Prakash, A., Chan, F.T.S., Deshmuch, S.G.: FMS scheduling with knowledge based genetic algorithm approach. Expert Systems with Applications 38, 3161–3171 (2011)

    Article  Google Scholar 

  10. Thornblad, K., Patriksson, M.: A note on the complexity of flow-shop scheduling with deteriorating jobs. Discrete Applied Mathematics 159, 251–253 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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 

  12. 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 

  13. Cheng, T.C.E., Gupta, M.C.: Survey of scheduling research involving due date determination decisions. European Journal of Operational Research 38(2), 156–166 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. 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 

  15. Baker, K.: Sequencing with earliness and tardiness Penalties: a review. Operation Research, 22–24 (1990)

    Google Scholar 

  16. 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 

  17. 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 (2009)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. 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 

  21. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucher, R.: Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics 1, 343–362 (1977)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Shuming Guan, Xiaoqing Lu & Ruyu Tian

  2. College of Science, Air Force Engineering University, Xi’An, China

    Jia Liu

Authors
  1. Shuming Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoqing Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jia Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ruyu Tian
    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

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

    Jincai Chang  & Aimin Yang  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guan, S., Lu, X., Liu, J., Tian, R. (2011). Study of the Single-Machine Multi-criteria Scheduling Problem with Common Due Date. In: Liu, C., Chang, J., Yang, A. (eds) Information Computing and Applications. ICICA 2011. Communications in Computer and Information Science, vol 244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27452-7_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27452-7_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27451-0

  • Online ISBN: 978-3-642-27452-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation