Single machine scheduling problem with controllable processing times and resource dependent release times

DOI10.1016/j.ejor.2006.07.005zbMath1131.90022OpenAlexW2050740443MaRDI QIDQ877039

Suk-Hun Yoon, Sung-Jin Chung, Byung-Cheon Choi

Publication date: 19 April 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.005

zbMATH Keywords

NP-completenesssingle machine schedulingpartition problemresource dependent release timecontrollable processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Scheduling with compressible and stochastic release dates ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity ⋮ Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption ⋮ A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph

Cites Work

• Unnamed Item
• Single machine scheduling with resource dependent release times and processing times
• Single machine group scheduling with resource dependent setup and processing times
• A survey of results for sequencing problems with controllable processing times
• Time-optimal control in a single machine problem with resource constraints
• Single machine scheduling problem with a common deadline and resource dependent release dates
• Single machine scheduling subject to deadlines and resource dependent processing times
• Some comments on sequencing with controllable processing times
• Positive half-products and scheduling with controllable processing times
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time
• 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
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Resource optimal control in some single-machine scheduling problems
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Single machine sequencing with linear models of release dates
• Single machine batch scheduling with resource dependent setup and processing times

This page was built for publication: Single machine scheduling problem with controllable processing times and resource dependent release times