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

DOI10.1016/J.COR.2018.09.005MaRDI QIDQ1628046zbMATH OpenOpenAlexFDO

Authors Christian Gahm, John J. Kanet, Axel Tuma

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

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

Recommendations

• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Sequencing heuristic for bicriteria scheduling in a single machine problem
• Dynamic non-preemptive single machine scheduling
• An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs
• Safe scheduling: Setting due dates in single-machine problems

Cites work

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

Cited in

(3)

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

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

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