Scheduling in Computer and Manufacturing Systems
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Business and Economics > Business and Management > Operational research > Scheduling in Computer and Manufacturing Systems
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This is a theoretical and application-oriented analysis of the deterministic scheduling problems arising in computer and manufacturing environments. The most important classical results are surveyed with particular attention paid to single-processor scheduling. Then more general models are studied, including resource-constrained scheduling, flexible flow shops, dynamic job shops, and special flexible manufacturing systems. For the convenience of less advanced readers, basic concepts from scheduling theory and related areas (eg computational complexity analysis) are also described. Polynomial and exponential-time optimization algorithms, as well as approximation and heuristic ones, are presented and discussed in the context of particular problems. For the presentation of algorithms, a PASCAL-like notation is adapted and used in almost all cases.

Table of Contents:
1 Introduction.- References.- 2 Preliminaries.- 2.1 Sets and Relations.- 2.2 Problems, Algorithms, Complexity.- 2.2.1 Problems and their Encoding.- 2.2.2 Algorithms.- 2.2.3 Complexity.- 2.3 Graphs and Networks.- 2.3.1 Basic Notions.- 2.3.2 Special Classes of Digraphs.- 2.3.3 Networks.- 2.4 Enumerative Methods.- 2.4.1 Dynamic Programming.- 2.4.2 Branch and Bound.- 2.5 Heuristic and Approximation Algorithms.- References.- 3 Formulation of Scheduling Problems.- 3.1 Definition of Scheduling Problems.- 3.2 Analysis of Scheduling Problems and Algorithms.- 3.3 Motivations for Deterministic Scheduling Problems.- 3.4 Classification of Deterministic Scheduling Problems.- References.- 4 Single Processor Scheduling.- 4.1 Minimizing Schedule Length.- 4.1.1 Scheduling with Release Times and Deadlines.- 4.1.2 Scheduling with Release Times and Delivery Times.- 4.2 Minimizing Mean Weighted Flow Time.- 4.3 Minimizing Due Date Involving Criteria.- 4.3.1 Maximum Lateness.- 4.3.2 Number of Tardy Tasks.- 4.3.3 Tardiness Problems.- 4.3.4 Earliness and Lateness Problems.- 4.4 Minimizing Change-Over Cost.- 4.4.1 Setup Scheduling.- 4.4.2 Lot Size Scheduling.- 4.5 Other Criteria.- 4.5.1 Minimizing Maximum Cost.- 4.5.2 Minimizing Mean Cost.- References.- 5 Parallel Processor Scheduling.- 5.1 Minimizing Schedule Length.- 5.1.1 Identical Processors.- 5.1.2 Uniform and Unrelated Processors.- 5.2 Minimizing Mean Row Time.- 5.2.1 Identical Processors.- 5.2.2 Uniform and Unrelated Processors.- 5.3 Minimizing Due Date Involving Criteria.- 5.3.1 Identical Processors.- 5.3.2 Uniform and Unrelated Processors.- 5.4 Other Models.- 5.4.1 Semi-Identical Processors.- 5.4.2 Scheduling Multiprocessor Tasks.- References.- 6 Static Shop Scheduling.- 6.1 Flow Shop Scheduling.- 6.2 Open Shop Scheduling.- 6.3 Job Shop Scheduling.- 6.3.1 Basic Ideas.- 6.3.2 Branch and Bound Algorithm.- 6.3.3 Simulated Annealing.- 6.3.4 Computational Results.- References.- 7 Resource Constrained Scheduling.- 7.1 Classical Model.- 7.2 Scheduling Multiprocessor Tasks.- 7.3 Scheduling with Continuous Resources.- 7.3.1 Introductory Remarks.- 7.3.2 Processing Speed vs. Resource Amount Model.- 7.3.3 Processing Time vs. Resource Amount Model.- 7.3.4 Ready Time vs. Resource Amount Model.- References.- 8 Scheduling in Flexible Manufacturing Systems.- 8.1 Introductory Remarks.- 8.2 Scheduling Flexible Flow Shops.- 8.2.1 Problem Formulation.- 8.2.2 Heuristics and their Performance.- 8.2.3 Branch and Bound Algorithm.- 8.3 Scheduling Dynamic Job Shops.- 8.3.1 Introductory Remarks.- 8.3.2 Heuristic Algorithm for the Static Problem.- 8.3.3 Computational Experiments.- 8.4 Simultaneous Scheduling and Routing in some FMS.- 8.4.1 Problem Formulation.- 8.4.2 Vehicle Scheduling for a Fixed Production Schedule.- 8.4.3 Simultaneous Job and Vehicle Scheduling.- References.- 9 From Theory to Practice.- 9.1 Scheduling in Computer Integrated Manufacturing.- 9.2 Solution Approaches Based on Artificial Intelligence.- 9.2.1 Interactive Scheduling.- 9.2.2 Knowledge-Based Systems.- 9.3 Integration of Knowledge and Algorithms.- 9.3.1 Intelligent Production Scheduling.- 9.3.2 Integrated Problem Solving.- References.


Best Sellers


Product Details
  • ISBN-13: 9783540580492
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Edition: Revised edition
  • No of Pages: 312
  • Weight: 690 gr
  • ISBN-10: 3540580492
  • Publisher Date: 12 Jul 1994
  • Binding: Hardback
  • Language: English
  • Returnable: Y


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Scheduling in Computer and Manufacturing Systems
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Scheduling in Computer and Manufacturing Systems
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Scheduling in Computer and Manufacturing Systems

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!