Minimizing total tardiness on a single machine with controllable processing times

DOI10.1016/j.cor.2008.05.009zbMath1179.90159OpenAlexW1971584650MaRDI QIDQ1000969

Chao-Tang Tseng, Ching-Jong Liao, Kuo-Ling Huang

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.05.009

zbMATH Keywords

schedulingsingle-machinetotal tardinesscontrollable processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times, Batch scheduling of identical jobs with controllable processing times, Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function, Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity, Adaptive online scheduling of tasks with anytime property on heterogeneous resources, Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources, Optimizing makespan and stability risks in job shop scheduling, Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness, Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, Single-machine scheduling with time-and-resource-dependent processing times, Scheduling two projects with controllable processing times in a single-machine environment, Variable neighbourhood search: methods and applications

Uses Software

• LINDO
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine scheduling with resource dependent release times and processing times
• A survey of results for sequencing problems with controllable processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• Single-machine sequencing with controllable processing times
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• Single machine scheduling subject to deadlines and resource dependent processing times
• Evaluation of leading heuristics for the single machine tardiness problem
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Single machine scheduling with discretely controllable processing times
• Variable neighborhood search
• A single machine scheduling problem with common due window and controllable processing times
• A variable neighborhood search for graph coloring.
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Minimizing the total weighted flow time in a single machine with controllable processing times
• A survey of scheduling with controllable processing times
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Minimizing Total Tardiness on One Machine is NP-Hard
• General flow-shop scheduling with resource constraints
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Variable neighborhood search for the p-median
• A genetic algorithm for flow shop scheduling problems
• The Total Tardiness Problem: Review and Extensions
• Variable neighborhood search: Principles and applications