An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
type: Item
instance of: scholarly article
title: An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
zbMATH Open document ID: 0799.90065
DOI: 10.1016/0377-2217(94)90331-X
author: Eugeniusz Nowicki
published in: European Journal of Operational Research
publication date: 1994-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 550255
zbMATH Keywords: approximation algorithms
zbMATH Keywords: worst-case analysis
zbMATH Keywords: single-machine scheduling
zbMATH Keywords: release times
zbMATH Keywords: delivery times
zbMATH Keywords: controllable job processing times
MaRDI profile type: Publication
cites work: The one-machine sequencing problem
cites work: A multi-objective approach to resource allocation in single machine scheduling
cites work: The Theory of Networks and Management Science. Part I
cites work: Job-shop scheduling with resource-time models of operations
cites work: A block approach for single-machine scheduling with release dates and due dates
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A Generalized Uniform Processor System
cites work: A two-machine flow shop scheduling problem with controllable job processing times
cites work: A survey of results for sequencing problems with controllable processing times
cites work: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
cites work: A bicriterion approach to time/cost trade-offs in sequencing
full work available at URL: 0377-2217(94)90331-x
OpenAlex ID: W2088657581
description: scientific article; zbMATH DE number 550255