Minimizing Lmax for the single machine scheduling problem with family set-ups

Simple item page
dc.citation.epage4330en_US
dc.citation.issueNumber20en_US
dc.citation.spage4315en_US
dc.citation.volumeNumber42en_US
dc.contributor.authorSchultz, S. R.en_US
dc.contributor.authorHodgson, T. J.en_US
dc.contributor.authorKing, R. E.en_US
dc.contributor.authorTaner, M. R.en_US
dc.date.accessioned2016-02-08T10:25:43Z
dc.date.available2016-02-08T10:25:43Z
dc.date.issued2004en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractA 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.identifier.doi10.1080/00207540410001716561en_US
dc.identifier.eissn1366-588X
dc.identifier.issn0020-7543
dc.identifier.urihttp://hdl.handle.net/11693/24210
dc.language.isoEnglishen_US
dc.publisherTaylor & Francisen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/00207540410001716561en_US
dc.source.titleInternational Journal of Production Researchen_US
dc.subjectAlgorithmsen_US
dc.subjectApproximation theoryen_US
dc.subjectFunctionsen_US
dc.subjectHeuristic methodsen_US
dc.subjectOptimal control systemsen_US
dc.subjectSchedulingen_US
dc.subjectBatch-partition heuristicsen_US
dc.subjectMachine scheduling problemen_US
dc.subjectPair-wise switchingen_US
dc.titleMinimizing Lmax for the single machine scheduling problem with family set-upsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
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
Download

Collections

Department of Industrial Engineering