Single machine scheduling with total tardiness criterion and convex controllable processing times

DOI10.1007/s10479-010-0827-6zbMath1225.90058MaRDI QIDQ646664

Liangjun Ke, Kailiang Xu, Zu-Ren Feng

Publication date: 17 November 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0827-6

zbMATH Keywords

single machine; convex resource consumption function; total tardiness criteria

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Throughput optimization for the Robotic Cell Problem with Controllable Processing Times, Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint, Two-machine flow shop scheduling with convex resource consumption functions, Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times, Resource cost aware scheduling, Research on permutation flow shop scheduling problems with general position-dependent learning effects, Some results of the worst-case analysis for flow shop scheduling with a learning effect, Unrelated parallel machine scheduling problem with special controllable processing times and setups

Cites Work

• Unnamed Item
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Minimizing the total weighted flow time in a single machine with controllable processing times
• A survey of scheduling with controllable processing times
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• Parallel machine scheduling with a convex resource consumption function
• Minimizing Total Tardiness on One Machine is NP-Hard
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions