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

DOI10.1007/S10951-007-0027-7MaRDI QIDQ835563zbMATHOpenAlexFDO

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

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

controllable processing timespseudo-polynomial time algorithmsingle-machine scheduling problemstrongly polynomial time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Scheduling to minimize the total compression and late costs
• Minimizing total tardiness on a single machine with controllable processing times
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• A bicriterion approach to time/cost trade-offs in sequencing
• A survey of results for sequencing problems with controllable processing times
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• 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
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Single machine scheduling with discretely controllable processing times
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• The discrete time-cost tradeoff problem revisited

Cited in

(8)

• Scheduling to tradeoff between the number and the length of accepted jobs
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Minimizing total tardiness on a single machine with controllable processing times
• Single-machine scheduling of multiple projects with controllable processing times
• A survey of scheduling with controllable processing times
• A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• Scheduling two projects with controllable processing times in a single-machine environment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835563)