A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions

DOI10.1016/0305-0548(93)90066-RzbMath0759.90047MaRDI QIDQ1207198

M. Raghavachari, Arif I. Rana, John Mittenthal

Publication date: 1 April 1993

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

zbMATH Keywords

simulated annealingsingle machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (13)

Completion time variance minimisation on two identical parallel processors ⋮ Pseudopolynomial algorithms for CTV minimization in single machine scheduling ⋮ Metaheuristics: A bibliography ⋮ \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions ⋮ A composite heuristic for the single machine early/tardy job scheduling problem. ⋮ A branch and bound algorithm to minimize completion time variance on a single processor. ⋮ Minimization of total absolute deviation for a common due date ⋮ A branch and price algorithm for single-machine completion time variance ⋮ Tabu search for a class of single-machine scheduling problems ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Completion time variance minimization in single machine and multi-machine systems ⋮ Bounds for the position of the smallest job in completion time variance minimization

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A V-shape property of optimal schedule of jobs about a common due date
• Scheduling problems with non-regular penalty functions - a review
• Single machine scheduling with coefficient of variation minimization
• V-shape property for optimal schedules with monotone penalty functions
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Minimizing Variation of Flow Time in Single Machine Systems
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Minimizing the Flow-time Variance in Single-machine Systems
• Equation of State Calculations by Fast Computing Machines
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions