Publication: Scheduling chains with identical jobs and constant delays on a single machine
| dc.contributor.coauthor | Brucker, P | |
| dc.contributor.coauthor | Knust, S | |
| dc.contributor.department | Department of Industrial Engineering | |
| dc.contributor.kuauthor | Oğuz, Ceyda | |
| dc.contributor.kuprofile | Faculty Member | |
| dc.contributor.other | Department of Industrial Engineering | |
| dc.contributor.schoolcollegeinstitute | College of Engineering | |
| dc.contributor.yokid | 6033 | |
| dc.date.accessioned | 2024-11-09T23:26:56Z | |
| dc.date.issued | 2006 | |
| dc.description.abstract | In this paper we study the single-machine problem 1|chains(l), p j = p|∑ C j in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between consecutive jobs in a chain are satisfied and the sum of all completion times of the jobs is minimized. We show that this problem is polynomially solvable. | |
| dc.description.indexedby | WoS | |
| dc.description.indexedby | Scopus | |
| dc.description.issue | 1 | |
| dc.description.openaccess | NO | |
| dc.description.publisherscope | International | |
| dc.description.volume | 63 | |
| dc.identifier.doi | 10.1007/s00186-005-0014-8 | |
| dc.identifier.eissn | 1432-5217 | |
| dc.identifier.issn | 1432-2994 | |
| dc.identifier.quartile | Q3 | |
| dc.identifier.scopus | 2-s2.0-32044466907 | |
| dc.identifier.uri | http://dx.doi.org/10.1007/s00186-005-0014-8 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14288/11635 | |
| dc.identifier.wos | 235113900004 | |
| dc.keywords | Scheduling | |
| dc.keywords | Time-lags | |
| dc.keywords | Delays | |
| dc.keywords | Complexity results | |
| dc.keywords | Time-lags | |
| dc.language | English | |
| dc.publisher | Springer | |
| dc.source | Mathematical Methods of Operations Research | |
| dc.subject | Operations research and management science | |
| dc.subject | Mathematics | |
| dc.subject | Applied mathematics | |
| dc.title | Scheduling chains with identical jobs and constant delays on a single machine | |
| dc.type | Journal Article | |
| dspace.entity.type | Publication | |
| local.contributor.authorid | 0000-0003-0994-1758 | |
| local.contributor.kuauthor | Oğuz, Ceyda | |
| relation.isOrgUnitOfPublication | d6d00f52-d22d-4653-99e7-863efcd47b4a | |
| relation.isOrgUnitOfPublication.latestForDiscovery | d6d00f52-d22d-4653-99e7-863efcd47b4a |