Single-machine scheduling with trade-off between number of tardy jobs and compression cost

DOI10.1007/s10951-007-0027-7zbMath1168.90443OpenAlexW2092460090MaRDI QIDQ835563

Qi Wei, Yong He, Cheng, T. C. Edwin

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1143

zbMATH Keywords

single-machine scheduling problemcontrollable processing timespseudo-polynomial time algorithmstrongly polynomial time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

A survey of scheduling with controllable processing times ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Scheduling two projects with controllable processing times in a single-machine environment

Cites Work

• Unnamed Item
• A survey of results for sequencing problems with controllable processing times
• The discrete time-cost tradeoff problem revisited
• A bicriterion approach to time/cost trade-offs in sequencing
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Single machine scheduling with discretely controllable processing times
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
• 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
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Single-machine scheduling with trade-off between number of tardy jobs and compression cost