SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN
From MaRDI portal
Publication:3052719
DOI10.1142/S0217595910002818zbMath1197.90242MaRDI QIDQ3052719
Shuxia Zhang, Zhigang Cao, Yu-Zhong Zhang
Publication date: 1 November 2010
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595910002818
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
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 to minimize the total weighted completion time with a constraint on the release time resource consumption
- Single machine scheduling with discretely controllable processing times
- Single machine scheduling of unit-time jobs with controllable release dates
- A permutation flow-shop scheduling problem with convex models of operation processing times
- Positive half-products and scheduling with controllable processing times
- Scheduling with controllable release dates and processing times: Makespan minimization
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Resource optimal control in some single-machine scheduling problems
- Single machine sequencing with linear models of release dates
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
