Minimizing Total Costs in One-Machine Scheduling

DOI10.1287/OPRE.23.5.908MaRDI QIDQ4088561zbMATH OpenOpenAlexFDO

Authors 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) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(47)

• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• Real-time scheduling of an automated manufacturing center
• An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
• A time indexed formulation of non-preemptive single machine scheduling problems
• 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
• Single machine earliness and tardiness scheduling
• A greedy heuristic for the mean tardiness sequencing problem
• 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
• Decomposition of the single machine total tardiness problem
• A new lower bounding scheme for the 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 the weighted sum of squared tardiness on a single machine
• Scheduling a single machine to minimize a regular objective function under setup constraints
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution
• A decomposition algorithm for the single machine total tardiness problem
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence
• Improving local search heuristics for some scheduling problems. I
• Optimal sequences in stochastic single machine shops
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
• Single machine scheduling with nonlinear cost functions
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
• Minimizing total tardiness on a single machine with unequal release dates
• Minimizing total tardiness in a scheduling problem with a learning effect
• A new branch and bound algorithm for minimizing the weighted number of tardy jobs
• One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
• Analysis of a linearization heuristic for single-machine scheduling to maximize profit
• 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
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
• Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons
• A dual algorithm for the one-machine scheduling problem
• Two-machine flowshop scheduling to minimize total tardiness
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• Minimizing tardiness in a two-machine flow-shop
• An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
• Scheduling about a common due date with earliness and tardiness penalties
• A controlled search simulated annealing method for the single machine weighted tardiness problem
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem

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

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