Scheduling parallel batch processing machines to minimize makespan using genetic algorithms
Guardat en:
| Publicat a: | ProQuest Dissertations and Theses (2006) |
|---|---|
| Autor principal: | |
| Publicat: |
ProQuest Dissertations & Theses
|
| Matèries: | |
| Accés en línia: | Citation/Abstract Full Text - PDF |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 304945106 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 978-0-542-80860-9 | ||
| 035 | |a 304945106 | ||
| 045 | 0 | |b d20060101 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Hirani, Neal S. | |
| 245 | 1 | |a Scheduling parallel batch processing machines to minimize makespan using genetic algorithms | |
| 260 | |b ProQuest Dissertations & Theses |c 2006 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a Batch processing machines are commonly used in manufacturing industries such as wafer fabrication, metal working, burn-in ovens and testing electrical circuits. Batch processing machines can process several jobs simultaneously. Due to growing competition, many manufacturers employ batch processing machines in order to reduce setup and overall processing (cycle) times. Batch processing machines are expensive. They should be utilized to the greatest extent possible to improve their benefit-to-cost ratio. The utilization of the batch processing machines can be improved by minimizing the makespan or the completion time of the last batch of jobs. The problem under study considers a set of batch processing machines in parallel commonly used to test Printed Circuit Boards (PCBs). The batch processing machine can process a batch of jobs as long the total size of all the jobs in the batch does not exceed the machine capacity. The processing time of the job and its size is given. The processing time of the batch is equal to the longest processing job in the batch. The objective is to minimize the makespan. A special case of the problem under study is NP-hard. Consequently, the problem under study is NP-hard. Exact procedures may require long processing times. (Abstract shortened by UMI.) | |
| 653 | |a Industrial engineering | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (2006) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/304945106/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/304945106/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |