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

DOI10.1016/J.EJOR.2005.06.072MaRDI QIDQ2433441zbMATH OpenOpenAlexFDO

Authors M. Y. Kovalyov, T. C. Edwin Cheng, N. V. Shakhlevich

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

controllable processing timescontrollable release datesdue-date schedulingparallel machinesschedulingsingle machinetotal completion time

Mathematics Subject Classification ID

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

Recommendations

• Scheduling with controllable release dates and processing times: Makespan minimization
• Single machine scheduling with controllable release and processing parameters
• Single machine scheduling of unit-time jobs with controllable release dates
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• Scheduling to minimize the total compression and late costs

Cites work

• A single machine scheduling problem with common due window and controllable processing times
• A survey of results for sequencing problems with controllable processing times
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• scientific article; zbMATH DE number 4191387 (Why is no real title available?)
• Minimization of the makespan in a two-machine problem under given resource constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Resource optimal control in some single-machine scheduling problems
• Scheduling around a small common due date
• Scheduling to minimize release-time resource consumption and tardiness penalties
• Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption
• Scheduling with controllable release dates and processing times: Makespan minimization
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Single machine scheduling problem with a common deadline and resource dependent release dates
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• Single machine scheduling with controllable release and processing parameters
• Single machine sequencing with linear models of release dates
• Single-machine sequencing with controllable processing times
• Time-optimal control in a single machine problem with resource constraints

Cited in

(21)

• Minimizing total tardiness on a single machine with controllable processing times
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case
• Minimizing total completion time subject to release dates and sequence-dependent processing times
• Single machine scheduling of unit-time jobs with controllable release dates
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• A survey of scheduling with controllable processing times
• Scheduling with controllable release dates and processing times: Makespan minimization
• Single machine scheduling with controllable release and processing parameters
• Scheduling with due date assignment under special conditions on job processing
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• Scheduling with discretely compressible release dates to minimize makespan
• Scheduling with compressible and stochastic release dates
• A multi-stage stochastic programming approach in master production scheduling
• Scheduling to minimize release-time resource consumption and tardiness penalties
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• 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

This page was built for publication: Scheduling with controllable release dates and processing times: total completion time minimization

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