On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution

DOI10.1287/mnsc.18.6.B301zbMath0231.90030MaRDI QIDQ5639517

Joel Shwimer

Publication date: 1972

Published in: Management Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

Improving the performance of enumerative search methods. I: Exploiting structure and intelligence, Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity, Real-time scheduling of an automated manufacturing center, A controlled search simulated annealing method for the single machine weighted tardiness problem, Minimizing total tardiness in a scheduling problem with a learning effect, A time indexed formulation of non-preemptive single machine scheduling problems, Scheduling of a single machine to minimize total weighted completion time subject to release dates, A dual algorithm for the one-machine scheduling problem, Single machine scheduling with nonlinear cost functions, Four solution techniques for a general one machine scheduling problem. A comparative study, A survey of algorithms for the single machine total weighted tardiness scheduling problem, Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine, A decomposition algorithm for the single machine total tardiness problem, Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem