Buy Flow Shop Scheduling with Synchronous and Asynchronous Transportation Times.
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 > Art, Film & Photography > Architecture > Flow Shop Scheduling with Synchronous and Asynchronous Transportation Times.
Flow Shop Scheduling with Synchronous and Asynchronous Transportation Times.

Flow Shop Scheduling with Synchronous and Asynchronous Transportation Times.


     0     
5
4
3
2
1



Out of Stock


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

This research studies two flow shop scheduling problems which consider transportation times between machines. The first problem considers a special case of a two-machine flow shop scheduling problem with asynchronous transportation times and the second one consider an application of flow shop scheduling to automated manufacturing cells with a synchronous material transportation device. The objective of both problems is to find a job schedule which minimizes the makespan -- the completion time of the last job.In the first problem, not only transportation times are explicitly provided but also the availability of the transporter is considered. In the model, there is one transporter with a specific capacity to transport jobs from the first machine to the second machine. The processing times on the first machine are job-independent. A threshold value for the transporter's capacity is derived. When the capacity of the transporter is greater than or equal to the threshold value, a dynamic programming algorithm is developed to obtain an optimal schedule. Given that n is the number of jobs, the computational effort of the proposed dynamic programming algorithm is shown to be O(n3), which is better than the best algorithm found in the literature.This research also considers a new flow shop scheduling problem with synchronous material movement. The automated machining center consists of a loading/unloading (L/U) station, m processing machines, and a rotary table. The L/U station and the processing machines surround the rotary table. In this machining center, a job is first loaded onto the rotary table at the L/U station. Then, the table rotates to transfer the job to the first machine, and subsequently to the second machine and so on. After being processed by the m machines, the job is transported back to the L/U station where it is unloaded from the machining center. A rotation of the table occurs only when all stations are finished with their jobs, including the loading and unloading operations at the L/U station. The mechanism of transferring all these jobs on the rotary table simultaneously to their next stations is referred to as synchronous material movement.Regarding the machining center with synchronous material movement, the simplest model with a single machine is studied first. The problem is shown to be NP-hard in the strong sense. A polynomial time algorithm is developed for a special case which assumes a constant unloading or loading time for all jobs. Moreover, due to the systematic structure of the problem, a dynamic programming algorithm is provided to obtain an optimal solution for a generalized version of the problem with m machines. The computational effort of the dynamic programming algorithm is also presented.Two-phase heuristic algorithms are developed to solve the problems with one machine and two machines. For each problem, two constructive heuristics and the modified neighborhood search algorithm are proposed, and computational experiments are conducted to test the performance of the proposed algorithms. The experimental results show that the two-phase algorithms generate high quality solutions in a very short time. A tighter lower bound is also developed for each case.


Best Sellers


Product Details
  • ISBN-13: 9781244721685
  • Publisher: Proquest, Umi Dissertation Publishing
  • Publisher Imprint: Proquest, Umi Dissertation Publishing
  • Height: 254 mm
  • Weight: 336 gr
  • ISBN-10: 1244721689
  • Publisher Date: 01 Sep 2011
  • Binding: Paperback
  • Spine Width: 11 mm
  • Width: 203 mm

Related Categories

Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Flow Shop Scheduling with Synchronous and Asynchronous Transportation Times.
Proquest, Umi Dissertation Publishing -
Flow Shop Scheduling with Synchronous and Asynchronous Transportation Times.
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.

Flow Shop Scheduling with Synchronous and Asynchronous Transportation Times.

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!