A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

DOI10.1002/nav.3800330319zbMath0601.90079OpenAlexW2004885905MaRDI QIDQ3737193

Suresh Chand, Hans Schneeberger

Publication date: 1986

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800330319

zbMATH Keywords

single-machine schedulingworst-case analysistotal weighted completion timeSmith-heuristic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Single machine scheduling to minimize weighted earliness subject to no tardy jobs ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times ⋮ An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. ⋮ Use of variable range in solving multiple criteria scheduling problems ⋮ Multicriteria scheduling problems: a survey ⋮ Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Genetic algorithms for the two-stage bicriteria flowshop problem

This page was built for publication: A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness