Scheduling with controllable release dates and processing times: Makespan minimization

DOI10.1016/J.EJOR.2005.06.021MaRDI QIDQ2433440zbMATH 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.021

zbMATH Keywords

controllable processing timescontrollable release datesMakespanschedulingsingle-machine

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: total completion time minimization
• Single machine scheduling of unit-time jobs with controllable release dates
• Single machine scheduling with controllable release and processing parameters
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

Cites work

• A review of planning and scheduling systems and methods for integrated steel production
• A survey of results for sequencing problems with controllable processing times
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• 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 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: total completion time 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 with controllable release and processing parameters
• Single machine sequencing with linear models of release dates
• Time-optimal control in a single machine problem with resource constraints

Cited in

(18)

• Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
• Single machine scheduling of unit-time jobs with controllable release dates
• Min-max controllable risk problems
• A survey of scheduling with controllable processing times
• Schedule execution for two-machine flow-shop with interval processing times
• Scheduling with controllable release dates and processing times: total completion time minimization
• Single machine scheduling with controllable release and processing parameters
• Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
• Two-machine open shop problem with controllable processing times
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• The fixed-charge shortest-path problem
• Scheduling with discretely compressible release dates to minimize makespan
• Scheduling with compressible and stochastic release dates
• Scheduling to minimize release-time resource consumption and tardiness penalties
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

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

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