|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 161 van 183 gevonden artikelen
| Titel: |
Study on constraint scheduling algorithm for job shop problems with multiple constraint machines |
| Auteur: |
Zuo, Yan Gu, Hanyu Xi, Yugeng |
| Verschenen in: |
International journal of production research |
| Paginering: | Jaargang 46 (2008) nr. 17 pagina's 4785-4801 |
| Jaar: |
2008-09-01 |
| Inhoud: |
This paper focuses on a job-shop scheduling problem with multiple constraint machines (JSPMC). A constraint scheduling method for the JSPMC is proposed. It divides the machines in the shop into constraint and non-constraint machines based on a new identification method, and formulates a reduced problem only for constraint machines while replacing the operations of non-constraint machines with time lags. The constraint machines are scheduled explicitly by solving the reduced problem with an efficient heuristic, while the non-constraint machines are scheduled by the earliest operation due date (EODD) dispatching rule. Extensive computational results indicate that the proposed constraint scheduling algorithm can obtain a better trade-off between solution quality and computation time compared with various versions of the shifting bottleneck (SB) methods for the JSPMC. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 161 van 183 gevonden artikelen
| << vorige | volgende >> |