Parallel dedicated machine scheduling with a single server: full precedence case
dc.citation.epage | 846 | en_US |
dc.citation.spage | 841 | en_US |
dc.contributor.author | Schultz, S. R. | en_US |
dc.contributor.author | Taner, Mehmet Rüştü | en_US |
dc.coverage.spatial | Houston TX, USA | en_US |
dc.date.accessioned | 2016-02-08T11:53:23Z | en_US |
dc.date.available | 2016-02-08T11:53:23Z | en_US |
dc.date.issued | 2004 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description | Date of Conference: 15 - 19 May 2004 | en_US |
dc.description | Conference Name: 13th Industrial Engineering Research Conference, IERC 2004 | en_US |
dc.description.abstract | The motivation for this study was the observation of a practical scenario that involves scheduling of two parallel machines attended by a single setup crew so as to minimize the makespan. This problem is known in scheduling literature as the parallel machine scheduling problem with a single server, P2S1/ / C max. In order to gain insight on this problem, we analyzed a constrained version of it. In this constrained case, jobs are dedicated to each machine, and the processing sequence on each machine is given and fixed. The problem is thus referred to as the parallel, dedicated machine scheduling problem with a single server and full precedence, PD2S1/full prec./ C max. We explore the combinatoric structure of the problem, and develop a branch and bound procedure and five heuristic algorithms. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T11:53:23Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2004 | en |
dc.identifier.uri | http://hdl.handle.net/11693/27438 | en_US |
dc.language.iso | English | en_US |
dc.publisher | IIE | en_US |
dc.source.title | Proceedings of the 13th Industrial Engineering Research Conference, IERC 2004 | en_US |
dc.subject | Parallel machines | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Single server | en_US |
dc.subject | Heuristic algorithms | en_US |
dc.subject | Heuristic methods | en_US |
dc.title | Parallel dedicated machine scheduling with a single server: full precedence case | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Parallel dedicated machine scheduling with A single server Full precedence case.pdf
- Size:
- 11.53 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version