Mostrar el registro sencillo del ítem
Single-machine common due date total earliness/tardiness scheduling with machine unavailability
| hal.structure.identifier | Sabanci University [Istanbul] | |
| dc.contributor.author | BÜLBÜL, Kerem | |
| hal.structure.identifier | CEDRIC. Optimisation Combinatoire [CEDRIC - OC] | |
| hal.structure.identifier | Recherche Opérationnelle [RO] | |
| dc.contributor.author | KEDAD-SIDHOUM, Safia | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | ŞEN, Halil | |
| dc.date.accessioned | 2024-04-04T02:57:26Z | |
| dc.date.available | 2024-04-04T02:57:26Z | |
| dc.date.issued | 2019-10 | |
| dc.identifier.issn | 1094-6136 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/192564 | |
| dc.description.abstractEn | Research on non-regular performance measures is at best scarce in the deterministic machine scheduling literature with machine unavailability constraints. Moreover, almost all existing works in this area assume either that processing on jobs interrupted by an interval of machine unavailability may be resumed without any additional setup/processing or that all prior processing is lost. In this work, we intend to partially fill these gaps by studying the problem of scheduling a single machine as to minimize the total deviation of the job completion times from an unre-strictive common due date when one or several fixed intervals of unavailability are present in the planning horizon. We also put a serious effort into investigating models with semi-resumable jobs so that processing on a job interrupted by an interval of machine unavailability may later be resumed at the expense of some extra processing time. The conventional assumptions regarding resumability are also taken into account. Several interesting cases are identified and explored, depending on the resumability scheme and the location of the interval of machine unavailability with respect to the common due date. The focus of analysis is on structural properties and drawing the boundary between polynomially solvable and NP−complete cases. Pseudo-polynomial dynamic programming algorithms are devised for NP−complete variants in the ordinary sense. | |
| dc.language.iso | en | |
| dc.publisher | Springer Verlag | |
| dc.subject.en | Semi-resumable | |
| dc.subject.en | Single-machine | |
| dc.subject.en | Earliness/tardiness | |
| dc.subject.en | Common due date | |
| dc.subject.en | Unrestrictive | |
| dc.subject.en | Resumable | |
| dc.subject.en | Maintenance | |
| dc.subject.en | Machine unavailability | |
| dc.subject.en | Dynamic programming | |
| dc.subject.en | NP−complete | |
| dc.subject.en | Non-resumable | |
| dc.title.en | Single-machine common due date total earliness/tardiness scheduling with machine unavailability | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1007/s10951-018-0585-x | |
| dc.subject.hal | Informatique [cs] | |
| bordeaux.journal | Journal of Scheduling | |
| bordeaux.page | 543-565 | |
| bordeaux.volume | 22 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 5 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-02470377 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-02470377v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal%20of%20Scheduling&rft.date=2019-10&rft.volume=22&rft.issue=5&rft.spage=543-565&rft.epage=543-565&rft.eissn=1094-6136&rft.issn=1094-6136&rft.au=B%C3%9CLB%C3%9CL,%20Kerem&KEDAD-SIDHOUM,%20Safia&%C5%9EEN,%20Halil&rft.genre=article |
Archivos en el ítem
| Archivos | Tamaño | Formato | Ver |
|---|---|---|---|
|
No hay archivos asociados a este ítem. |
|||