Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
$48.39 / copy at 25+ copies As low as $47.29 at 100+Your best volume price
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Turn this order into a program
Groups that order in bulk often pair the copies with something more. We handle the extras so you don't have to.
One address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment options Pair it with a branded journalJournals with your logo or each reader's name, for the same group.
Branded journals
Bring in a speaker
BookPal is partnering with Talezo to help you find and book authors, speakers and performers for your event.
BookPal × TalezoTime-Dependent Path Scheduling
Moving assembly lines are the stepping stone for mass production of automobiles. Here, every second counts, which necessitates planners to meticulously optimize them. A crucial factor is each worker’s nonproductive walking time between the moving workpiece and line-side material containers for picking up required material. Minimizing the walking time is difficult because the workpiece moves steadily. Helmut A. Sedding devises algorithms to optimize the sequence of work operations, and the placement of material containers. Thereby, he introduces a novel category of time-dependent scheduling problems, and lays the basis for the algorithmic optimization of time-dependent paths at the moving assembly line.
About the Author:
Helmut A. Sedding passed his doctoral thesis with distinction at the Institute of Theoretical Computer Science at Ulm University, Germany. He researches on modeling, complexity analysis, and algorithm design for the solution of various optimization problems. His practical experience includes the development of automotive production planning software in use at major car manufacturers.
The book, Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line [Bulk, Wholesale, Quantity] ISBN#9783658284145 in Paperback by Helmut A. Sedding may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details
- Publisher
- Springer Fachmedien Wiesbaden
- Author
- Helmut A. Sedding
- Format
- Paperback
- Published
- Dec 3, 2019
- ISBN-13
- 9783658284145
- Pages
- 169
- Printing
- Printed on demand
Time-Dependent Path Scheduling in bulk: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $48.39 | 12% off list |
| 50 – 99 | $47.84 | 13% off list |
| 100+ | $47.29 | 14% off list |
Popular for
For new managers and leadership cohorts, a chapter per session.
A shared vocabulary for the whole organization.
A takeaway attendees will actually read, delivered to your venue.
How fast can I get copies of Time-Dependent Path Scheduling?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship in bulk to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other bulk booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
What buyers say
Write a Review
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
Teams also order
A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.