Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case
type: Item
instance of: scholarly article
title: Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case
zbMATH Open document ID: 0933.68015
author: Guochun Tang
author: Les R. Foulds
published in: Applied Mathematics. Series B (English Edition)
publication date: 1999-05-11T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1286439
zbMATH Keywords: machine scheduling problem
MaRDI profile type: Publication
full work available at URL: s11766-999-0057-3
OpenAlex ID: W2092990304
cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
cites work: Worst-Case Analysis of Heuristic Algorithms
cites work: Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
DOI: 10.1007/S11766-999-0057-3
description: scientific article; zbMATH DE number 1286439