Models and Algorithms of Time-Dependent Scheduling
Stanisław Gawiejnowicz· ISBN 9783662593622
Special offer terms
Zookal Study Premium
Subscribe & save
By selecting the 'Susbcribe & Save' option you are enrolling in an auto-renewing subscription of Zookal Study Premium. Cancel at anytime.
Auto-Renewal
Your Zookal Study Premium subscription will be renewed each month until you cancel. You consent to Zookal automatically charging your payment method on file NZ$19.99 each month after 1st month free period until you cancel.
How to Cancel
You can cancel your subscription anytime by visiting Manage account page, clicking "Manage subscription" and completing the steps to cancel. Cancellations take effect at the end of the 1st month free period (if applicable) or at the end of the current billing cycle in which your request to cancel was received. Subscription fees are not refundable.
Zookal Study Premium Monthly Subscription Includes:
Ability to post up to ten (10) questions per month.
20% off your textbooks order and free standard shipping whenever you shop online at
textbooks.zookal.co.nz
Unused monthly subscription benefits have no cash value, are not transferable, and expire at the end of each month. This means that subscription benefits do not roll over to or accumulate for use in subsequent months.
Payment Methods
Afterpay and Zip Pay will not be available for purchases with Zookal Study Premium subscription added to bag.
NZ$1.00 preauthorisation
You may see a NZ$1.00 preauthorisation by your bank which will disappear from your statement in a few business days..
Email communications
By adding Zookal Study Premium, you agree to receive email communications from Zookal.
This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, time-dependent scheduling with two criteria and time-dependent two-agent scheduling. The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes. The previous edition of the book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.