A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
type: Item
instance of: scholarly article
title: A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
zbMATH Open document ID: 0759.90047
DOI: 10.1016/0305-0548(93)90066-R
author: John Mittenthal
author: M. Raghavachari
author: Arif I. Rana
published in: Computers \& Operations Research
publication date: 1993-04-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 149367
zbMATH Keywords: single machine scheduling
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
cites work: Q3938812
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Scheduling problems with non-regular penalty functions - a review
cites work: Variance Minimization in Single Machine Sequencing Problems
cites work: Minimizing the Time-in-System Variance for a Finite Jobset
cites work: Minimising Waiting Time Variance in the Single Machine Problem
cites work: Minimizing Variation of Flow Time in Single Machine Systems
cites work: Deterministic and Random Single Machine Sequencing with Variance Minimization
cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
cites work: Minimizing the Flow-time Variance in Single-machine Systems
cites work: Single machine scheduling with coefficient of variation minimization
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: A V-shape property of optimal schedule of jobs about a common due date
cites work: V-shape property for optimal schedules with monotone penalty functions
cites work: Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
cites work: Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Optimization by Simulated Annealing
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
description: scientific article; zbMATH DE number 149367