Single machine scheduling with total tardiness criterion and convex controllable processing times
type: Item
instance of: scholarly article
title: Single machine scheduling with total tardiness criterion and convex controllable processing times
zbMATH Open document ID: 1225.90058
author: Kailiang Xu
author: Liangjun Ke
author: Zuren Feng
published in: Annals of Operations Research
publication date: 2011-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5973837
zbMATH Keywords: single machine
zbMATH Keywords: total tardiness criteria
zbMATH Keywords: convex resource consumption function
MaRDI profile type: Publication
full work available at URL: s10479-010-0827-6
OpenAlex ID: W1978460437
cites work: Multiple-machine scheduling with earliness, tardiness and completion time penalties
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3741388
cites work: Convex resource allocation for minimizing the makespan in a single machine with job release dates
cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
cites work: Minimizing the total weighted flow time in a single machine with controllable processing times
cites work: Parallel machine scheduling with a convex resource consumption function
cites work: A survey of scheduling with controllable processing times
cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
cites work: A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
cites work: A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
cites work: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
DOI: 10.1007/S10479-010-0827-6
Recommended article: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
Recommended article: Single machine scheduling problems with controllable processing times and total absolute differences penalties
Recommended article: Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs
Recommended article: Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
Recommended article: Single machine scheduling with discretely controllable processing times
Recommended article: Q4453997
Recommended article: Minimizing total tardiness on a single machine with controllable processing times
Recommended article: Q4927593
Recommended article: Q5277368
Recommended article: SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
description: scientific article; zbMATH DE number 5973837