|
| << 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 10 van 24 gevonden artikelen
| Titel: |
Fabrication and assembly scheduling in a two-machine flowshop |
| Auteur: |
Lin, B.M.T. Cheng, T.C.E. |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 34 (2002) nr. 11 pagina's 1015-1020 |
| Jaar: |
2002-11-01 |
| Inhoud: |
This paper considers a fabrication scheduling problem to minimize the makespan in a two-machine flowshop. Each job has a unique component and a common component to be processed on the first machine. On machine 1, the common components of the jobs are grouped into batches for processing with a setup cost incurred whenever a batch is formed. A job is ready for its assembly operation on the second machine if both its unique and common components are finished on machine 1. The problems with batch availability and item availability are known as NP-hard. In this paper, we give proofs for the strong NP-hardness of the two problems. The results suggest that it is very unlikely to develop polynomial- or pseudo-polynomial-time algorithm for finding exact solutions for the two problems. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 10 van 24 gevonden artikelen
| << vorige | volgende >> |