Minimizing Total Costs in One-Machine Scheduling

DOI10.1287/OPRE.23.5.908zbMath0324.90039OpenAlexW1985217989MaRDI QIDQ4088561

Alexander H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/21828

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (45)

A dynamic programming method for single machine scheduling ⋮ One machine scheduling to minimize expected mean tardiness. II ⋮ Scheduling in a sequence dependent setup environment with genetic search ⋮ Dynamic programming and decomposition approaches for the single machine total tardiness problem ⋮ Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons ⋮ Improving the performance of enumerative search methods. I: Exploiting structure and intelligence ⋮ A new branch and bound algorithm for minimizing the weighted number of tardy jobs ⋮ Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness ⋮ Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity ⋮ Decomposition of the single machine total tardiness problem ⋮ A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness ⋮ Real-time scheduling of an automated manufacturing center ⋮ Improving local search heuristics for some scheduling problems. I ⋮ Optimal sequences in stochastic single machine shops ⋮ A new lower bounding scheme for the total weighted tardiness problem. ⋮ Scheduling about a common due date with earliness and tardiness penalties ⋮ A controlled search simulated annealing method for the single machine weighted tardiness problem ⋮ An algorithm for single machine sequencing with deadlines to minimize total weighted completion time ⋮ Two-machine flowshop scheduling to minimize total tardiness ⋮ Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem ⋮ An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem ⋮ An exact algorithm for the minimum squared load assignment problem ⋮ Minimizing total tardiness on a single machine with unequal release dates ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ Analysis of a linearization heuristic for single-machine scheduling to maximize profit ⋮ Precedence theorems and dynamic programming for the single-machine weighted tardiness problem ⋮ A time indexed formulation of non-preemptive single machine scheduling problems ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ A dual algorithm for the one-machine scheduling problem ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ Single machine scheduling with nonlinear cost functions ⋮ Minimizing tardiness in a two-machine flow-shop ⋮ Four solution techniques for a general one machine scheduling problem. A comparative study ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty ⋮ A population-based variable neighborhood search for the single machine total weighted tardiness problem ⋮ A survey of algorithms for the single machine total weighted tardiness scheduling problem ⋮ Single machine earliness and tardiness scheduling ⋮ Single machine scheduling to minimize mean absolute lateness: A heuristic solution ⋮ A decomposition algorithm for the single machine total tardiness problem ⋮ Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem ⋮ A greedy heuristic for the mean tardiness sequencing problem ⋮ One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons

This page was built for publication: Minimizing Total Costs in One-Machine Scheduling