On the flexibility of a decision theory-based heuristic for single machine scheduling

DOI10.1016/j.cor.2018.09.005zbMath1458.90293OpenAlexW2892345225MaRDI QIDQ1628046

Axel Tuma, John J. Kanet, Christian Gahm

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-441904

zbMATH Keywords

decision theorysingle machinesequencingpriority dispatching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective

Cites Work

• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• A lower bound for weighted completion time variance
• Completion time variance minimization in single machine and multi-machine systems
• A decomposition scheme for single stage scheduling problems
• The single-machine total tardiness scheduling problem: review and extensions
• A survey of priority rule-based scheduling
• Mimimization of agreeably weighted variance in single machine systems
• Multiple and bicriteria scheduling: A literature survey
• Four solution techniques for a general one machine scheduling problem. A comparative study
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Bounds for the position of the smallest job in completion time variance minimization
• Complexity of single machine, multi-criteria scheduling problems
• Dynamic non-preemptive single machine scheduling
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Job shop scheduling with beam search
• Minimizing the sum of squares lateness on a single machine
• Improved heuristics for the early/tardy scheduling problem with no idle time
• A weighted modified due date rule for sequencing to minimize weighted tardiness
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
• Multicriteria scheduling
• Planning and Scheduling in Manufacturing and Services
• Principles of Sequencing and Scheduling
• The Single Machine Early/Tardy Problem
• Minimizing Variation of Flow Time in Single Machine Systems
• Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: On the flexibility of a decision theory-based heuristic for single machine scheduling