Single machine scheduling with discretely controllable processing times
type: Item
instance of: scholarly article
title: Single machine scheduling with discretely controllable processing times
zbMATH Open document ID: 0888.90088
DOI: 10.1016/S0167-6377(97)00010-2
author: Zhi-Long Chen
author: Qing Lu
author: Guochun Tang
published in: Operations Research Letters
publication date: 1997-11-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1089840
zbMATH Keywords: controllable processing times
zbMATH Keywords: single machine
zbMATH Keywords: sum of the total processing cost
zbMATH Keywords: makespan
zbMATH Keywords: maximum tardiness
zbMATH Keywords: total completion time
zbMATH Keywords: pseudo-polynomial dynamic programming algorithms
MaRDI profile type: Publication
cites work: Q3056948
cites work: Two parallel machine sequencing problems involving controllable job processing times
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
cites work: Scheduling to minimize the total compression and late costs
cites work: Flow Shop Scheduling with Resource Flexibility
cites work: `` Strong '' NP-Completeness Results
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Reducibility among Combinatorial Problems
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: A survey of results for sequencing problems with controllable processing times
cites work: Single-machine sequencing with controllable processing times
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: Scheduling Multiple Variable-Speed Machines
cites work: A bicriterion approach to time/cost trade-offs in sequencing
cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
cites work: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
full work available at URL: s0167-6377(97)00010-2
OpenAlex ID: W2021910328
description: scientific article; zbMATH DE number 1089840