Show simple item record

dc.contributor.authorOğuz, C.en_US
dc.contributor.authorDincer, C.en_US
dc.date.accessioned2016-02-08T10:52:58Z
dc.date.available2016-02-08T10:52:58Z
dc.date.issued1994en_US
dc.identifier.issn0160-5682
dc.identifier.urihttp://hdl.handle.net/11693/25960
dc.description.abstractThe purpose of this paper is to analyze a special case of the non-pre-emptive single machine scheduling problem where the distinct due dates for each job are related to processing times according to the Equal-Slack rule. The scheduling objective is to minimize the sum of earliness and tardiness penalties. After determining some properties of the problem, the unrestricted case is shown to be equivalent to a polynomial time solvable problem, whereas the restricted case is shown to be NP-hard, and suggestions are made for further research.en_US
dc.language.isoEnglishen_US
dc.source.titleJournal of the Operational Research Societyen_US
dc.relation.isversionofhttps://doi.org/10.1057/jors.1994.87en_US
dc.subjectComputational complexityen_US
dc.subjectJob analysisen_US
dc.subjectOperations researchen_US
dc.subjectOptimizationen_US
dc.subjectTime and motion studyen_US
dc.subjectTurnaround timeen_US
dc.subjectDue datesen_US
dc.subjectEarliness penaltyen_US
dc.subjectEqual slack ruleen_US
dc.subjectProcessing timesen_US
dc.subjectSingle machine scheduling problemen_US
dc.subjectTardiness penaltyen_US
dc.subjectSchedulingen_US
dc.titleSingle machine earliness-tardiness scheduling problems using the equal-slack ruleen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage589en_US
dc.citation.epage594en_US
dc.citation.volumeNumber45en_US
dc.citation.issueNumber5en_US
dc.identifier.doi10.1057/jors.1994.87en_US
dc.publisherPalgrave Macmillan Ltd.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record