Skip to main content
SpringerLink
Log in

Search Strategies for Problems with Detectable Boundaries and Restricted Level Sets

  • Conference paper
  • First Online:
Data and Decision Sciences in Action

Part of the book series: Lecture Notes in Management and Industrial Engineering ((LNMIE))

  • 951 Accesses

Abstract

The chapter is concerned with a class of discrete optimisation problems which includes a number of classical NP-hard scheduling problems. The considered solution method is an iterative procedure that at each iteration, it computes a lower bound on the optimal objective value and searches for a feasible solution attaining this bound. The chapter describes three search methods—descending search, ascending search, and their combination. These methods are illustrated by considering their implementations for the unit execution time unit communication delay maximum lateness problem with parallel identical machines. The resultant algorithms are compared by means of computational experiments.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Ullman, J.D.: NP-complete scheduling problems. J. Comp. Syst. Sci. 10, 384–393 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  2. Zinder, Y., Memar, J., Singh, G.: Discrete optimization with polynomially detectable boundaries and restricted level sets. In: Wu, W., Daescu, O. (eds.) COCOA 2010. LNCS, vol. 6508, pp. 142–156. Springer, Heidelberg (2010)

    Google Scholar 

  3. Zinder, Y., Su, B., Singh, G., Sorli, R.: Scheduling UET-UCT tasks: branch-and-bound search in priority space. Optim. Eng. 11, 627–646 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Zinder, Y., Memar, J., Singh, G.: Discrete optimization with polynomially detectable boundaries and restricted level sets. J. Comb. Optim. 25, 308–325 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Technology, PO Box 123, Broadway, Sydney, NSW, 2007, Australia

    Hanyu Gu, Julia Memar & Yakov Zinder

Authors
  1. Hanyu Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julia Memar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yakov Zinder
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julia Memar .

Editor information

Editors and Affiliations

  1. School of Engineering and Information Technology, University of New South Wales, Canberra, Aust Capital Terr, Australia

    Ruhul Sarker

  2. School of Engineering and Information Technology, University of New South Wales, Canberra, Aust Capital Terr, Australia

    Hussein A. Abbass

  3. Data 61, Commonwealth Scientific and Industrial Research Organisation (CSIRO), Melbourne, Victoria, Australia

    Simon Dunstall

  4. Data 61, Commonwealth Scientific and Industrial Research Organisation (CSIRO), Melbourne, Victoria, Australia

    Philip Kilby

  5. Strategic Capability Analysis Department, Defence Science and Technology Group, Canberra, Aust Capital Terr, Australia

    Richard Davis

  6. Department of Defence, War Research Centre, Canberra, Aust Capital Terr, Australia

    Leon Young

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Gu, H., Memar, J., Zinder, Y. (2018). Search Strategies for Problems with Detectable Boundaries and Restricted Level Sets. In: Sarker, R., Abbass, H., Dunstall, S., Kilby, P., Davis, R., Young, L. (eds) Data and Decision Sciences in Action. Lecture Notes in Management and Industrial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-55914-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-55914-8_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-55913-1

  • Online ISBN: 978-3-319-55914-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation