An exact algorithm for the bi-objective timing problem

DOI10.1007/S11590-018-1237-YMaRDI QIDQ1653286zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Sophie Jacquin, Fanny Dufossé, Laetitia Jourdan

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)

Recommendations

• scientific article; zbMATH DE number 6378894
• An exact algorithm for biobjective integer programming problems
• Exact algorithms for the imbalanced time minimizing assignment problem
• An algorithm for construction of optimal timing solutions in problems with a stochastic payoff function
• Algorithms for time-dependent bicriteria shortest path problems
• On the optimality of exact and approximation algorithms for scheduling problems
• An efficient time algorithm for makespan objectives
• An approximation scheme for the bi-scenario sum of completion times trade-off problem
• Approximation Algorithms for Scheduling Problems with Exact Delays
• Approximation algorithms for time constrained scheduling

Cites work

• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• An improved earliness--tardiness timing algorithm
• Bicriteria Transportation Problem
• Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem
• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
• Minimizing the earliness--tardiness costs on a single machine
• Multicriteria models for just-in-time scheduling
• Multicriteria optimization
• Piecewise linear multicriteria programs: the continuous case and its discontinuous generalization
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• 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
• The one-machine just-in-time scheduling problem with preemption

Cited in

(1)

• Time-explicit Darwin PIC algorithm

This page was built for publication: An exact algorithm for the bi-objective timing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653286)