Single machine earliness-tardiness scheduling problems using the equal-slack rule
dc.citation.epage | 594 | en_US |
dc.citation.issueNumber | 5 | en_US |
dc.citation.spage | 589 | en_US |
dc.citation.volumeNumber | 45 | en_US |
dc.contributor.author | Oğuz, C. | en_US |
dc.contributor.author | Dincer, C. | en_US |
dc.date.accessioned | 2016-02-08T10:52:58Z | |
dc.date.available | 2016-02-08T10:52:58Z | |
dc.date.issued | 1994 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | The 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.identifier.doi | 10.1057/jors.1994.87 | en_US |
dc.identifier.issn | 0160-5682 | |
dc.identifier.uri | http://hdl.handle.net/11693/25960 | |
dc.language.iso | English | en_US |
dc.publisher | Palgrave Macmillan Ltd. | en_US |
dc.relation.isversionof | https://doi.org/10.1057/jors.1994.87 | en_US |
dc.source.title | Journal of the Operational Research Society | en_US |
dc.subject | Computational complexity | en_US |
dc.subject | Job analysis | en_US |
dc.subject | Operations research | en_US |
dc.subject | Optimization | en_US |
dc.subject | Time and motion study | en_US |
dc.subject | Turnaround time | en_US |
dc.subject | Due dates | en_US |
dc.subject | Earliness penalty | en_US |
dc.subject | Equal slack rule | en_US |
dc.subject | Processing times | en_US |
dc.subject | Single machine scheduling problem | en_US |
dc.subject | Tardiness penalty | en_US |
dc.subject | Scheduling | en_US |
dc.title | Single machine earliness-tardiness scheduling problems using the equal-slack rule | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Single machine earliness-tardiness scheduling problems using the equal-slack rule.pdf
- Size:
- 1.57 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version