Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almahu_9949198284502882
    Format: X, 326 p. , online resource.
    Edition: 1st ed. 1995.
    ISBN: 9783662030882
    Content: Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent change over times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics. Also complexity issues are addressed.
    Note: 1 Classification of Scheduling Problems -- 2 Some Problems in Combinatorial Optimization -- 3 Computational Complexity -- 4 Single Machine Scheduling Problems -- 5 Parallel Machines -- 6 Shop Scheduling Problems -- 7 Due-Date Scheduling -- 8 Batching Problems -- 9 Changeover Times and Transportation Times -- 10 Multiprocessor Tasks -- 11 Multi-Purpose Machines -- References.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662030905
    Additional Edition: Printed edition: ISBN 9783662030899
    Additional Edition: Printed edition: ISBN 9783540600879
    Language: English
    Subjects: Computer Science , Economics , Mathematics
    RVK:
    RVK:
    RVK:
    Keywords: Lehrbuch
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages