An exact algorithm for the bi-objective timing problem

DOI10.1007/s11590-018-1237-yzbMath1403.90608OpenAlexW2788193379WikidataQ59262649 ScholiaQ59262649MaRDI QIDQ1653286

Laetitia Jourdan, Sophie Jacquin, Fanny Dufossé

Publication date: 3 August 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1237-y

zbMATH Keywords

exact algorithmbi-objectivejust-in-time schedulingtiming problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• An improved earliness--tardiness timing algorithm
• The one-machine just-in-time scheduling problem with preemption
• Multicriteria optimization
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
• Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm
• Minimizing the earliness--tardiness costs on a single machine
• Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem
• Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization
• Multicriteria models for just-in-time scheduling
• Bicriteria Transportation Problem