The dependent shop sequencing algorithm A general algorithm for solving flow shop, job shop, and dependent shop sequencing problems
| Autor: | Don L. Spencer, Richard A. Dudek |
|---|---|
| Rok vydání: | 1973 |
| Předmět: | |
| Zdroj: | International Journal of Production Research. 11:325-339 |
| ISSN: | 1366-588X 0020-7543 |
| DOI: | 10.1080/00207547308929983 |
| Popis: | This article describes a heuristic algorithm which will yield an optimal or near optimal minimal makespan solution to a specific type of sequencing/scheduling problem defined as the dependent sequencing problem which includes the pure job-shop and flow-shop sequencing problems. The name ‘ dependent sequencing ’ was selected for this model since it reflects the possibility of interdependence between activities of the technological processing order graph (GTPO) not present in ‘ pure ’ job -shop or f low-shop sequencing models. There are some approaches to this class of problem which provide optimal solutions, but their time to solutions and/or theoretical approaches make them difficult to understand and apply. Recent articles in the literature have recommended that research in the sequencing/ scheduling area be directed toward developing practical approaches which can be easily understood and applied. The dependent shop algorithm utilizes extensions of PERT/CPM techniques which are widely known and therefor... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|