An exact algorithm for the bi-objective ...
Document type :
Article dans une revue scientifique: Article original
Title :
An exact algorithm for the bi-objective timing problem
Author(s) :
Jacquin, Sophie [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Dufossé, Fanny [Auteur]
Data Aware Large Scale Computing [DATAMOVE ]
Operational Research, Knowledge And Data [ORKAD]
Jourdan, Laetitia [Auteur]
Operational Research, Knowledge And Data [ORKAD]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Dufossé, Fanny [Auteur]
Data Aware Large Scale Computing [DATAMOVE ]
Operational Research, Knowledge And Data [ORKAD]
Jourdan, Laetitia [Auteur]

Operational Research, Knowledge And Data [ORKAD]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Journal title :
Optimization Letters
Pages :
903–914
Publisher :
Springer Verlag
Publication date :
2018-02-01
ISSN :
1862-4472
English keyword(s) :
Timing problem
Exact algorithm
Just-in-time scheduling
Bi-objective
Exact algorithm
Just-in-time scheduling
Bi-objective
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
The timing problem in the bi-objective just-in-time single-machine job-shop scheduling problem (JiT-JSP) is the task to schedule N jobs whose order is fixed, with each job incurring a linear earliness penalty for finishing ...
Show more >The timing problem in the bi-objective just-in-time single-machine job-shop scheduling problem (JiT-JSP) is the task to schedule N jobs whose order is fixed, with each job incurring a linear earliness penalty for finishing ahead of its due date and a linear tardiness penalty for finishing after its due date. The goal is to minimize the earliness and tardiness simultaneously. We propose an exact greedy algorithm that finds the entire Pareto front in O(N2) time. This algorithm is asymptotically optimal.Show less >
Show more >The timing problem in the bi-objective just-in-time single-machine job-shop scheduling problem (JiT-JSP) is the task to schedule N jobs whose order is fixed, with each job incurring a linear earliness penalty for finishing ahead of its due date and a linear tardiness penalty for finishing after its due date. The goal is to minimize the earliness and tardiness simultaneously. We propose an exact greedy algorithm that finds the entire Pareto front in O(N2) time. This algorithm is asymptotically optimal.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- document
- Open access
- Access the document
- Jacquin2018.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- Jacquin2018.pdf
- Open access
- Access the document