Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints

From MaRDI portal
Publication:320637

DOI10.1016/j.ejor.2015.07.001zbMath1346.90351OpenAlexW1465950394WikidataQ58761574 ScholiaQ58761574MaRDI QIDQ320637

Oliver Herr, Asvin Goel

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.07.001




Related Items (15)

Distributionally robust single machine scheduling with the total tardiness criterionBi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problemMinimizing maximum tardiness on a single machine with family setup times and machine disruptionSingle machine scheduling with release dates: a distributionally robust approachA multivariate complexity analysis of the material consumption scheduling problemApproximation schemes for parallel machine scheduling with non-renewable resourcesUnnamed ItemILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardinessA hybrid adaptively genetic algorithm for task scheduling problem in the phased array radarExact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup timesEPTAS for load balancing problem on parallel machines with a non-renewable resourceEffective IG heuristics for a single-machine scheduling problem with family setups and resource constraintsTarget-based distributionally robust optimization for single machine schedulingNew complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraintsEPTAS for load balancing problem on parallel machines with a non-renewable resource



Cites Work


This page was built for publication: Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints