Minimizing Lmax for the single machine scheduling problem with family set-ups
dc.citation.epage | 4330 | en_US |
dc.citation.issueNumber | 20 | en_US |
dc.citation.spage | 4315 | en_US |
dc.citation.volumeNumber | 42 | en_US |
dc.contributor.author | Schultz, S. R. | en_US |
dc.contributor.author | Hodgson, T. J. | en_US |
dc.contributor.author | King, R. E. | en_US |
dc.contributor.author | Taner, M. R. | en_US |
dc.date.accessioned | 2016-02-08T10:25:43Z | |
dc.date.available | 2016-02-08T10:25:43Z | |
dc.date.issued | 2004 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of problems. It performs well compared with other heuristics, and it is effective in finding solutions for large problems. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:25:43Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2004 | en |
dc.identifier.doi | 10.1080/00207540410001716561 | en_US |
dc.identifier.eissn | 1366-588X | |
dc.identifier.issn | 0020-7543 | |
dc.identifier.uri | http://hdl.handle.net/11693/24210 | |
dc.language.iso | English | en_US |
dc.publisher | Taylor & Francis | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1080/00207540410001716561 | en_US |
dc.source.title | International Journal of Production Research | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Approximation theory | en_US |
dc.subject | Functions | en_US |
dc.subject | Heuristic methods | en_US |
dc.subject | Optimal control systems | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Batch-partition heuristics | en_US |
dc.subject | Machine scheduling problem | en_US |
dc.subject | Pair-wise switching | en_US |
dc.title | Minimizing Lmax for the single machine scheduling problem with family set-ups | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Minimizing_Lmax_for_the_single_machine_scheduling_problem_with_family_set-ups.pdf
- Size:
- 340.94 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version