Scheduling with controllable release dates and processing times: total completion time minimization

DOI10.1016/j.ejor.2005.06.072zbMath1142.90396OpenAlexW1991579210MaRDI QIDQ2433441

Mikhail Y. Kovalyov, Natalia V. Shakhlevich, Cheng, T. C. Edwin

Publication date: 27 October 2006

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

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

zbMATH Keywords

schedulingparallel machinessingle machinetotal completion timedue-date schedulingcontrollable processing timescontrollable release dates

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

A survey of scheduling with controllable processing times ⋮ 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 ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ A multi-stage stochastic programming approach in master production scheduling ⋮ Scheduling with controllable release dates and processing times: Makespan minimization ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment

Cites Work

• 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
• Scheduling around a small common due date
• Single-machine sequencing with controllable processing times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Minimization of the makespan in a two-machine problem under given resource constraints
• Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption
• A single machine scheduling problem with common due window and controllable processing times
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• Scheduling with controllable release dates and processing times: Makespan minimization
• Single machine scheduling with controllable release and processing parameters
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Scheduling to minimize release-time resource consumption and tardiness penalties
• Unnamed Item